./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/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 24241c008259f315336df16b66c76f690577877c ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/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 24241c008259f315336df16b66c76f690577877c .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:57:49,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:57:49,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:57:49,510 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:57:49,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:57:49,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:57:49,511 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:57:49,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:57:49,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:57:49,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:57:49,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:57:49,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:57:49,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:57:49,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:57:49,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:57:49,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:57:49,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:57:49,519 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:57:49,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:57:49,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:57:49,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:57:49,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:57:49,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:57:49,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:57:49,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:57:49,527 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:57:49,527 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:57:49,527 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:57:49,527 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:57:49,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:57:49,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:57:49,529 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:57:49,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:57:49,529 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:57:49,530 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:57:49,530 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:57:49,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:57:49,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:57:49,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:57:49,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:57:49,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:57:49,532 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:57:49,541 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:57:49,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:57:49,542 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:57:49,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:57:49,542 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:57:49,543 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:57:49,543 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:57:49,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:57:49,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:57:49,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:57:49,543 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:57:49,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:57:49,544 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:57:49,544 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:57:49,544 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:57:49,544 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:57:49,544 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:57:49,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:57:49,544 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:57:49,545 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:57:49,545 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:57:49,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:57:49,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:57:49,545 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:57:49,545 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:57:49,545 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:57:49,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:57:49,545 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:57:49,546 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:57:49,546 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_de8d4909-bda7-407a-a0c3-ba81d098d28f/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 -> 24241c008259f315336df16b66c76f690577877c [2019-12-07 17:57:49,642 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:57:49,649 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:57:49,652 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:57:49,652 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:57:49,653 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:57:49,653 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-2.c [2019-12-07 17:57:49,689 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/data/f9153fb3a/3050e72c3f8b4300b5b29e42cd6243c6/FLAG2b52f2f9d [2019-12-07 17:57:50,094 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:57:50,094 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-2.c [2019-12-07 17:57:50,108 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/data/f9153fb3a/3050e72c3f8b4300b5b29e42cd6243c6/FLAG2b52f2f9d [2019-12-07 17:57:50,116 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/data/f9153fb3a/3050e72c3f8b4300b5b29e42cd6243c6 [2019-12-07 17:57:50,117 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:57:50,118 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:57:50,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:57:50,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:57:50,122 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:57:50,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:57:50" (1/1) ... [2019-12-07 17:57:50,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d84b64d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:50, skipping insertion in model container [2019-12-07 17:57:50,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:57:50" (1/1) ... [2019-12-07 17:57:50,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:57:50,170 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:57:50,445 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:57:50,455 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:57:50,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:57:50,531 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:57:50,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:50 WrapperNode [2019-12-07 17:57:50,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:57:50,532 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:57:50,532 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:57:50,532 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:57:50,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:50" (1/1) ... [2019-12-07 17:57:50,555 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:50" (1/1) ... [2019-12-07 17:57:50,592 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:57:50,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:57:50,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:57:50,593 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:57:50,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:50" (1/1) ... [2019-12-07 17:57:50,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:50" (1/1) ... [2019-12-07 17:57:50,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:50" (1/1) ... [2019-12-07 17:57:50,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:50" (1/1) ... [2019-12-07 17:57:50,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:50" (1/1) ... [2019-12-07 17:57:50,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:50" (1/1) ... [2019-12-07 17:57:50,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:50" (1/1) ... [2019-12-07 17:57:50,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:57:50,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:57:50,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:57:50,666 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:57:50,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:57:50,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 17:57:50,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:57:50,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:57:50,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 17:57:50,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 17:57:50,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 17:57:50,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:57:50,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:57:50,859 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 17:57:51,365 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 17:57:51,365 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 17:57:51,366 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:57:51,366 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 17:57:51,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:57:51 BoogieIcfgContainer [2019-12-07 17:57:51,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:57:51,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:57:51,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:57:51,369 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:57:51,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:57:50" (1/3) ... [2019-12-07 17:57:51,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595c2d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:57:51, skipping insertion in model container [2019-12-07 17:57:51,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:50" (2/3) ... [2019-12-07 17:57:51,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595c2d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:57:51, skipping insertion in model container [2019-12-07 17:57:51,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:57:51" (3/3) ... [2019-12-07 17:57:51,372 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.10.i.cil-2.c [2019-12-07 17:57:51,378 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:57:51,384 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:57:51,392 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:57:51,410 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:57:51,410 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:57:51,410 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:57:51,410 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:57:51,410 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:57:51,410 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:57:51,410 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:57:51,410 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:57:51,425 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-12-07 17:57:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 17:57:51,432 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:51,433 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:51,433 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:51,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:51,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1126320416, now seen corresponding path program 1 times [2019-12-07 17:57:51,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:51,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936000436] [2019-12-07 17:57:51,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:51,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:51,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936000436] [2019-12-07 17:57:51,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:51,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:51,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070853006] [2019-12-07 17:57:51,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:51,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:51,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:51,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:51,691 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 4 states. [2019-12-07 17:57:51,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:51,997 INFO L93 Difference]: Finished difference Result 317 states and 535 transitions. [2019-12-07 17:57:51,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:51,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-07 17:57:51,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:52,007 INFO L225 Difference]: With dead ends: 317 [2019-12-07 17:57:52,007 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 17:57:52,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:52,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 17:57:52,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2019-12-07 17:57:52,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 17:57:52,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 220 transitions. [2019-12-07 17:57:52,042 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 220 transitions. Word has length 41 [2019-12-07 17:57:52,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:52,043 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 220 transitions. [2019-12-07 17:57:52,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:52,043 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 220 transitions. [2019-12-07 17:57:52,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 17:57:52,045 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:52,045 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:52,045 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:52,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:52,046 INFO L82 PathProgramCache]: Analyzing trace with hash -589138407, now seen corresponding path program 1 times [2019-12-07 17:57:52,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:52,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548313719] [2019-12-07 17:57:52,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:52,124 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:52,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548313719] [2019-12-07 17:57:52,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:52,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:52,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19458053] [2019-12-07 17:57:52,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:52,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:52,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:52,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:52,128 INFO L87 Difference]: Start difference. First operand 143 states and 220 transitions. Second operand 4 states. [2019-12-07 17:57:52,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:52,374 INFO L93 Difference]: Finished difference Result 284 states and 431 transitions. [2019-12-07 17:57:52,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:52,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-07 17:57:52,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:52,376 INFO L225 Difference]: With dead ends: 284 [2019-12-07 17:57:52,376 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 17:57:52,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:52,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 17:57:52,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2019-12-07 17:57:52,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 17:57:52,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 219 transitions. [2019-12-07 17:57:52,385 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 219 transitions. Word has length 54 [2019-12-07 17:57:52,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:52,386 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 219 transitions. [2019-12-07 17:57:52,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:52,386 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 219 transitions. [2019-12-07 17:57:52,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 17:57:52,388 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:52,388 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:52,389 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:52,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:52,389 INFO L82 PathProgramCache]: Analyzing trace with hash -873991893, now seen corresponding path program 1 times [2019-12-07 17:57:52,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:52,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661473216] [2019-12-07 17:57:52,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:52,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:52,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661473216] [2019-12-07 17:57:52,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:52,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:52,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626805477] [2019-12-07 17:57:52,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:52,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:52,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:52,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:52,476 INFO L87 Difference]: Start difference. First operand 143 states and 219 transitions. Second operand 4 states. [2019-12-07 17:57:52,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:52,686 INFO L93 Difference]: Finished difference Result 283 states and 429 transitions. [2019-12-07 17:57:52,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:52,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-07 17:57:52,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:52,687 INFO L225 Difference]: With dead ends: 283 [2019-12-07 17:57:52,687 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 17:57:52,688 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:52,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 17:57:52,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 143. [2019-12-07 17:57:52,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 17:57:52,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 218 transitions. [2019-12-07 17:57:52,694 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 218 transitions. Word has length 55 [2019-12-07 17:57:52,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:52,695 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 218 transitions. [2019-12-07 17:57:52,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:52,695 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 218 transitions. [2019-12-07 17:57:52,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 17:57:52,696 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:52,696 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:52,696 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:52,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:52,697 INFO L82 PathProgramCache]: Analyzing trace with hash -2010193898, now seen corresponding path program 1 times [2019-12-07 17:57:52,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:52,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072472970] [2019-12-07 17:57:52,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:52,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072472970] [2019-12-07 17:57:52,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:52,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:52,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351850069] [2019-12-07 17:57:52,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:52,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:52,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:52,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:52,742 INFO L87 Difference]: Start difference. First operand 143 states and 218 transitions. Second operand 4 states. [2019-12-07 17:57:52,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:52,943 INFO L93 Difference]: Finished difference Result 281 states and 426 transitions. [2019-12-07 17:57:52,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:52,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-07 17:57:52,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:52,945 INFO L225 Difference]: With dead ends: 281 [2019-12-07 17:57:52,945 INFO L226 Difference]: Without dead ends: 157 [2019-12-07 17:57:52,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:52,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-12-07 17:57:52,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 143. [2019-12-07 17:57:52,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 17:57:52,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 217 transitions. [2019-12-07 17:57:52,951 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 217 transitions. Word has length 55 [2019-12-07 17:57:52,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:52,951 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 217 transitions. [2019-12-07 17:57:52,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:52,952 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 217 transitions. [2019-12-07 17:57:52,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 17:57:52,952 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:52,952 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:52,952 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:52,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:52,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1549428566, now seen corresponding path program 1 times [2019-12-07 17:57:52,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:52,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701770064] [2019-12-07 17:57:52,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:53,007 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:53,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701770064] [2019-12-07 17:57:53,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:53,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:53,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803477963] [2019-12-07 17:57:53,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:53,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:53,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:53,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:53,008 INFO L87 Difference]: Start difference. First operand 143 states and 217 transitions. Second operand 4 states. [2019-12-07 17:57:53,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:53,195 INFO L93 Difference]: Finished difference Result 280 states and 424 transitions. [2019-12-07 17:57:53,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:53,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-07 17:57:53,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:53,197 INFO L225 Difference]: With dead ends: 280 [2019-12-07 17:57:53,197 INFO L226 Difference]: Without dead ends: 156 [2019-12-07 17:57:53,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:53,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-12-07 17:57:53,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-12-07 17:57:53,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 17:57:53,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 216 transitions. [2019-12-07 17:57:53,202 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 216 transitions. Word has length 55 [2019-12-07 17:57:53,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:53,202 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 216 transitions. [2019-12-07 17:57:53,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:53,202 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 216 transitions. [2019-12-07 17:57:53,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 17:57:53,203 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:53,203 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:53,203 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:53,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:53,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1877613889, now seen corresponding path program 1 times [2019-12-07 17:57:53,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:53,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996863783] [2019-12-07 17:57:53,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:53,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:53,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996863783] [2019-12-07 17:57:53,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:53,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:53,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690351020] [2019-12-07 17:57:53,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:53,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:53,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:53,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:53,240 INFO L87 Difference]: Start difference. First operand 143 states and 216 transitions. Second operand 4 states. [2019-12-07 17:57:53,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:53,417 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2019-12-07 17:57:53,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:53,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-07 17:57:53,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:53,419 INFO L225 Difference]: With dead ends: 280 [2019-12-07 17:57:53,419 INFO L226 Difference]: Without dead ends: 156 [2019-12-07 17:57:53,420 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:53,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-12-07 17:57:53,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-12-07 17:57:53,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 17:57:53,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 215 transitions. [2019-12-07 17:57:53,424 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 215 transitions. Word has length 55 [2019-12-07 17:57:53,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:53,424 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 215 transitions. [2019-12-07 17:57:53,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:53,424 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 215 transitions. [2019-12-07 17:57:53,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:57:53,425 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:53,425 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:53,425 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:53,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:53,425 INFO L82 PathProgramCache]: Analyzing trace with hash 559324962, now seen corresponding path program 1 times [2019-12-07 17:57:53,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:53,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476478104] [2019-12-07 17:57:53,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:53,463 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:53,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476478104] [2019-12-07 17:57:53,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:53,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:53,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73508856] [2019-12-07 17:57:53,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:53,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:53,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:53,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:53,464 INFO L87 Difference]: Start difference. First operand 143 states and 215 transitions. Second operand 4 states. [2019-12-07 17:57:53,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:53,676 INFO L93 Difference]: Finished difference Result 280 states and 422 transitions. [2019-12-07 17:57:53,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:53,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 17:57:53,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:53,677 INFO L225 Difference]: With dead ends: 280 [2019-12-07 17:57:53,678 INFO L226 Difference]: Without dead ends: 156 [2019-12-07 17:57:53,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:53,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-12-07 17:57:53,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-12-07 17:57:53,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 17:57:53,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 214 transitions. [2019-12-07 17:57:53,681 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 214 transitions. Word has length 56 [2019-12-07 17:57:53,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:53,681 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 214 transitions. [2019-12-07 17:57:53,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:53,681 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 214 transitions. [2019-12-07 17:57:53,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 17:57:53,682 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:53,682 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:53,682 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:53,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:53,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1118749788, now seen corresponding path program 1 times [2019-12-07 17:57:53,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:53,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321990121] [2019-12-07 17:57:53,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:53,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:53,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321990121] [2019-12-07 17:57:53,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:53,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:53,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421331346] [2019-12-07 17:57:53,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:53,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:53,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:53,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:53,723 INFO L87 Difference]: Start difference. First operand 143 states and 214 transitions. Second operand 4 states. [2019-12-07 17:57:53,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:53,921 INFO L93 Difference]: Finished difference Result 280 states and 421 transitions. [2019-12-07 17:57:53,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:53,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 17:57:53,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:53,922 INFO L225 Difference]: With dead ends: 280 [2019-12-07 17:57:53,922 INFO L226 Difference]: Without dead ends: 156 [2019-12-07 17:57:53,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:53,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-12-07 17:57:53,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-12-07 17:57:53,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 17:57:53,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 213 transitions. [2019-12-07 17:57:53,926 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 213 transitions. Word has length 57 [2019-12-07 17:57:53,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:53,926 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 213 transitions. [2019-12-07 17:57:53,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:53,926 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2019-12-07 17:57:53,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 17:57:53,927 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:53,927 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:53,927 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:53,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:53,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1513227289, now seen corresponding path program 1 times [2019-12-07 17:57:53,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:53,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987542003] [2019-12-07 17:57:53,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:53,959 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:53,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987542003] [2019-12-07 17:57:53,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:53,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:53,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094111431] [2019-12-07 17:57:53,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:53,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:53,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:53,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:53,960 INFO L87 Difference]: Start difference. First operand 143 states and 213 transitions. Second operand 4 states. [2019-12-07 17:57:54,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:54,147 INFO L93 Difference]: Finished difference Result 270 states and 407 transitions. [2019-12-07 17:57:54,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:54,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 17:57:54,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:54,149 INFO L225 Difference]: With dead ends: 270 [2019-12-07 17:57:54,149 INFO L226 Difference]: Without dead ends: 146 [2019-12-07 17:57:54,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:54,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-12-07 17:57:54,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2019-12-07 17:57:54,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 17:57:54,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 212 transitions. [2019-12-07 17:57:54,152 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 212 transitions. Word has length 58 [2019-12-07 17:57:54,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:54,152 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 212 transitions. [2019-12-07 17:57:54,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:54,152 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 212 transitions. [2019-12-07 17:57:54,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 17:57:54,153 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:54,153 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:54,153 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:54,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:54,154 INFO L82 PathProgramCache]: Analyzing trace with hash -383138993, now seen corresponding path program 1 times [2019-12-07 17:57:54,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:54,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914850542] [2019-12-07 17:57:54,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:54,195 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:54,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914850542] [2019-12-07 17:57:54,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:54,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:54,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346460548] [2019-12-07 17:57:54,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:54,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:54,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:54,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:54,197 INFO L87 Difference]: Start difference. First operand 143 states and 212 transitions. Second operand 4 states. [2019-12-07 17:57:54,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:54,416 INFO L93 Difference]: Finished difference Result 310 states and 468 transitions. [2019-12-07 17:57:54,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:54,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 17:57:54,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:54,418 INFO L225 Difference]: With dead ends: 310 [2019-12-07 17:57:54,418 INFO L226 Difference]: Without dead ends: 186 [2019-12-07 17:57:54,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:54,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-07 17:57:54,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2019-12-07 17:57:54,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-12-07 17:57:54,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 250 transitions. [2019-12-07 17:57:54,423 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 250 transitions. Word has length 58 [2019-12-07 17:57:54,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:54,424 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 250 transitions. [2019-12-07 17:57:54,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:54,424 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 250 transitions. [2019-12-07 17:57:54,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 17:57:54,425 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:54,425 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:54,425 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:54,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:54,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1542897590, now seen corresponding path program 1 times [2019-12-07 17:57:54,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:54,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857626266] [2019-12-07 17:57:54,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:54,466 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:54,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857626266] [2019-12-07 17:57:54,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:54,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:54,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592927171] [2019-12-07 17:57:54,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:54,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:54,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:54,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:54,468 INFO L87 Difference]: Start difference. First operand 165 states and 250 transitions. Second operand 4 states. [2019-12-07 17:57:54,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:54,705 INFO L93 Difference]: Finished difference Result 332 states and 505 transitions. [2019-12-07 17:57:54,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:54,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-07 17:57:54,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:54,706 INFO L225 Difference]: With dead ends: 332 [2019-12-07 17:57:54,706 INFO L226 Difference]: Without dead ends: 186 [2019-12-07 17:57:54,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:54,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-07 17:57:54,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2019-12-07 17:57:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-12-07 17:57:54,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 249 transitions. [2019-12-07 17:57:54,711 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 249 transitions. Word has length 71 [2019-12-07 17:57:54,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:54,711 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 249 transitions. [2019-12-07 17:57:54,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 249 transitions. [2019-12-07 17:57:54,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 17:57:54,712 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:54,712 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:54,712 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:54,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:54,712 INFO L82 PathProgramCache]: Analyzing trace with hash -375755494, now seen corresponding path program 1 times [2019-12-07 17:57:54,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:54,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317950287] [2019-12-07 17:57:54,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:54,739 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:54,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317950287] [2019-12-07 17:57:54,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:54,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:54,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043742447] [2019-12-07 17:57:54,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:54,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:54,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:54,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:54,740 INFO L87 Difference]: Start difference. First operand 165 states and 249 transitions. Second operand 4 states. [2019-12-07 17:57:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:54,947 INFO L93 Difference]: Finished difference Result 331 states and 502 transitions. [2019-12-07 17:57:54,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:54,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-12-07 17:57:54,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:54,948 INFO L225 Difference]: With dead ends: 331 [2019-12-07 17:57:54,948 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 17:57:54,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:54,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 17:57:54,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 165. [2019-12-07 17:57:54,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-12-07 17:57:54,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 248 transitions. [2019-12-07 17:57:54,952 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 248 transitions. Word has length 72 [2019-12-07 17:57:54,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:54,952 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 248 transitions. [2019-12-07 17:57:54,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:54,952 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 248 transitions. [2019-12-07 17:57:54,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 17:57:54,953 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:54,953 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:54,953 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:54,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:54,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1511957499, now seen corresponding path program 1 times [2019-12-07 17:57:54,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:54,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829853229] [2019-12-07 17:57:54,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:54,982 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:54,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829853229] [2019-12-07 17:57:54,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:54,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:54,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055398912] [2019-12-07 17:57:54,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:54,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:54,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:54,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:54,983 INFO L87 Difference]: Start difference. First operand 165 states and 248 transitions. Second operand 4 states. [2019-12-07 17:57:55,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:55,216 INFO L93 Difference]: Finished difference Result 329 states and 498 transitions. [2019-12-07 17:57:55,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:55,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-12-07 17:57:55,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:55,218 INFO L225 Difference]: With dead ends: 329 [2019-12-07 17:57:55,218 INFO L226 Difference]: Without dead ends: 183 [2019-12-07 17:57:55,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:55,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-12-07 17:57:55,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 165. [2019-12-07 17:57:55,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-12-07 17:57:55,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 247 transitions. [2019-12-07 17:57:55,223 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 247 transitions. Word has length 72 [2019-12-07 17:57:55,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:55,224 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 247 transitions. [2019-12-07 17:57:55,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:55,224 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 247 transitions. [2019-12-07 17:57:55,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 17:57:55,224 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:55,225 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:55,225 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:55,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:55,225 INFO L82 PathProgramCache]: Analyzing trace with hash 2047664965, now seen corresponding path program 1 times [2019-12-07 17:57:55,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:55,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573823172] [2019-12-07 17:57:55,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:55,264 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:55,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573823172] [2019-12-07 17:57:55,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:55,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:55,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45036375] [2019-12-07 17:57:55,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:55,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:55,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:55,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:55,266 INFO L87 Difference]: Start difference. First operand 165 states and 247 transitions. Second operand 4 states. [2019-12-07 17:57:55,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:55,501 INFO L93 Difference]: Finished difference Result 328 states and 495 transitions. [2019-12-07 17:57:55,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:55,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-12-07 17:57:55,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:55,503 INFO L225 Difference]: With dead ends: 328 [2019-12-07 17:57:55,503 INFO L226 Difference]: Without dead ends: 182 [2019-12-07 17:57:55,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:55,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-12-07 17:57:55,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-12-07 17:57:55,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-12-07 17:57:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 246 transitions. [2019-12-07 17:57:55,506 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 246 transitions. Word has length 72 [2019-12-07 17:57:55,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:55,506 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 246 transitions. [2019-12-07 17:57:55,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:55,507 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 246 transitions. [2019-12-07 17:57:55,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 17:57:55,507 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:55,507 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:55,507 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:55,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:55,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1379377490, now seen corresponding path program 1 times [2019-12-07 17:57:55,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:55,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884173266] [2019-12-07 17:57:55,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:55,535 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:55,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884173266] [2019-12-07 17:57:55,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:55,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:55,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033630619] [2019-12-07 17:57:55,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:55,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:55,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:55,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:55,537 INFO L87 Difference]: Start difference. First operand 165 states and 246 transitions. Second operand 4 states. [2019-12-07 17:57:55,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:55,777 INFO L93 Difference]: Finished difference Result 328 states and 493 transitions. [2019-12-07 17:57:55,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:55,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-12-07 17:57:55,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:55,779 INFO L225 Difference]: With dead ends: 328 [2019-12-07 17:57:55,779 INFO L226 Difference]: Without dead ends: 182 [2019-12-07 17:57:55,779 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:55,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-12-07 17:57:55,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-12-07 17:57:55,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-12-07 17:57:55,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 245 transitions. [2019-12-07 17:57:55,784 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 245 transitions. Word has length 72 [2019-12-07 17:57:55,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:55,784 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 245 transitions. [2019-12-07 17:57:55,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:55,785 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2019-12-07 17:57:55,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 17:57:55,785 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:55,785 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:55,786 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:55,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:55,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1175215853, now seen corresponding path program 1 times [2019-12-07 17:57:55,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:55,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700345674] [2019-12-07 17:57:55,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:55,819 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:55,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700345674] [2019-12-07 17:57:55,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:55,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:55,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901543103] [2019-12-07 17:57:55,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:55,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:55,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:55,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:55,821 INFO L87 Difference]: Start difference. First operand 165 states and 245 transitions. Second operand 4 states. [2019-12-07 17:57:56,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:56,053 INFO L93 Difference]: Finished difference Result 328 states and 491 transitions. [2019-12-07 17:57:56,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:56,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-07 17:57:56,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:56,054 INFO L225 Difference]: With dead ends: 328 [2019-12-07 17:57:56,054 INFO L226 Difference]: Without dead ends: 182 [2019-12-07 17:57:56,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:56,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-12-07 17:57:56,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-12-07 17:57:56,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-12-07 17:57:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2019-12-07 17:57:56,058 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 73 [2019-12-07 17:57:56,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:56,058 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2019-12-07 17:57:56,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:56,059 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2019-12-07 17:57:56,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 17:57:56,059 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:56,059 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:56,059 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:56,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:56,059 INFO L82 PathProgramCache]: Analyzing trace with hash 945059795, now seen corresponding path program 1 times [2019-12-07 17:57:56,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:56,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411698706] [2019-12-07 17:57:56,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:56,086 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:56,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411698706] [2019-12-07 17:57:56,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:56,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:56,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290208853] [2019-12-07 17:57:56,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:56,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:56,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:56,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:56,087 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand 4 states. [2019-12-07 17:57:56,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:56,309 INFO L93 Difference]: Finished difference Result 328 states and 489 transitions. [2019-12-07 17:57:56,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:56,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 17:57:56,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:56,310 INFO L225 Difference]: With dead ends: 328 [2019-12-07 17:57:56,310 INFO L226 Difference]: Without dead ends: 182 [2019-12-07 17:57:56,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:56,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-12-07 17:57:56,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-12-07 17:57:56,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-12-07 17:57:56,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2019-12-07 17:57:56,314 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 74 [2019-12-07 17:57:56,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:56,314 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2019-12-07 17:57:56,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:56,314 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2019-12-07 17:57:56,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 17:57:56,314 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:56,315 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:56,315 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:56,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:56,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1959639656, now seen corresponding path program 1 times [2019-12-07 17:57:56,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:56,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125175812] [2019-12-07 17:57:56,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:56,342 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:56,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125175812] [2019-12-07 17:57:56,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:56,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:56,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026336293] [2019-12-07 17:57:56,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:56,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:56,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:56,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:56,343 INFO L87 Difference]: Start difference. First operand 165 states and 243 transitions. Second operand 4 states. [2019-12-07 17:57:56,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:56,527 INFO L93 Difference]: Finished difference Result 318 states and 474 transitions. [2019-12-07 17:57:56,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:56,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 17:57:56,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:56,529 INFO L225 Difference]: With dead ends: 318 [2019-12-07 17:57:56,529 INFO L226 Difference]: Without dead ends: 172 [2019-12-07 17:57:56,529 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:56,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-12-07 17:57:56,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 165. [2019-12-07 17:57:56,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-12-07 17:57:56,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 242 transitions. [2019-12-07 17:57:56,533 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 242 transitions. Word has length 75 [2019-12-07 17:57:56,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:56,534 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 242 transitions. [2019-12-07 17:57:56,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:56,534 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 242 transitions. [2019-12-07 17:57:56,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 17:57:56,534 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:56,535 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:56,535 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:56,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:56,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1761634740, now seen corresponding path program 1 times [2019-12-07 17:57:56,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:56,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252732999] [2019-12-07 17:57:56,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:56,589 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:57:56,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252732999] [2019-12-07 17:57:56,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:56,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:56,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225857131] [2019-12-07 17:57:56,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:56,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:56,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:56,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:56,591 INFO L87 Difference]: Start difference. First operand 165 states and 242 transitions. Second operand 4 states. [2019-12-07 17:57:56,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:56,899 INFO L93 Difference]: Finished difference Result 416 states and 623 transitions. [2019-12-07 17:57:56,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:56,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-07 17:57:56,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:56,901 INFO L225 Difference]: With dead ends: 416 [2019-12-07 17:57:56,901 INFO L226 Difference]: Without dead ends: 270 [2019-12-07 17:57:56,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:56,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-12-07 17:57:56,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 206. [2019-12-07 17:57:56,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-12-07 17:57:56,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2019-12-07 17:57:56,907 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 80 [2019-12-07 17:57:56,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:56,907 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2019-12-07 17:57:56,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:56,907 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2019-12-07 17:57:56,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 17:57:56,908 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:56,908 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:56,908 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:56,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:56,908 INFO L82 PathProgramCache]: Analyzing trace with hash -83732426, now seen corresponding path program 1 times [2019-12-07 17:57:56,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:56,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956434603] [2019-12-07 17:57:56,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:57:56,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956434603] [2019-12-07 17:57:56,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:56,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:56,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38729072] [2019-12-07 17:57:56,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:56,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:56,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:56,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:56,951 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2019-12-07 17:57:57,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:57,200 INFO L93 Difference]: Finished difference Result 442 states and 685 transitions. [2019-12-07 17:57:57,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:57,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-07 17:57:57,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:57,202 INFO L225 Difference]: With dead ends: 442 [2019-12-07 17:57:57,202 INFO L226 Difference]: Without dead ends: 255 [2019-12-07 17:57:57,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:57,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-12-07 17:57:57,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2019-12-07 17:57:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-12-07 17:57:57,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2019-12-07 17:57:57,206 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 80 [2019-12-07 17:57:57,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:57,206 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2019-12-07 17:57:57,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:57,207 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2019-12-07 17:57:57,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 17:57:57,207 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:57,207 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:57,208 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:57,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:57,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1230430550, now seen corresponding path program 1 times [2019-12-07 17:57:57,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:57,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72417863] [2019-12-07 17:57:57,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:57,257 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:57:57,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72417863] [2019-12-07 17:57:57,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:57,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:57,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951763049] [2019-12-07 17:57:57,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:57,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:57,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:57,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:57,259 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2019-12-07 17:57:57,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:57,806 INFO L93 Difference]: Finished difference Result 499 states and 773 transitions. [2019-12-07 17:57:57,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:57,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-12-07 17:57:57,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:57,809 INFO L225 Difference]: With dead ends: 499 [2019-12-07 17:57:57,809 INFO L226 Difference]: Without dead ends: 288 [2019-12-07 17:57:57,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:57,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-12-07 17:57:57,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 231. [2019-12-07 17:57:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-12-07 17:57:57,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 359 transitions. [2019-12-07 17:57:57,815 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 359 transitions. Word has length 81 [2019-12-07 17:57:57,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:57,815 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 359 transitions. [2019-12-07 17:57:57,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:57,815 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 359 transitions. [2019-12-07 17:57:57,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-07 17:57:57,816 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:57,816 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:57,816 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:57,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:57,816 INFO L82 PathProgramCache]: Analyzing trace with hash -47127035, now seen corresponding path program 1 times [2019-12-07 17:57:57,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:57,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336212345] [2019-12-07 17:57:57,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:57,862 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:57:57,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336212345] [2019-12-07 17:57:57,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:57,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:57,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989688596] [2019-12-07 17:57:57,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:57,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:57,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:57,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:57,863 INFO L87 Difference]: Start difference. First operand 231 states and 359 transitions. Second operand 4 states. [2019-12-07 17:57:58,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:58,168 INFO L93 Difference]: Finished difference Result 500 states and 773 transitions. [2019-12-07 17:57:58,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:58,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-12-07 17:57:58,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:58,170 INFO L225 Difference]: With dead ends: 500 [2019-12-07 17:57:58,170 INFO L226 Difference]: Without dead ends: 288 [2019-12-07 17:57:58,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:58,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-12-07 17:57:58,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 231. [2019-12-07 17:57:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-12-07 17:57:58,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 358 transitions. [2019-12-07 17:57:58,174 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 358 transitions. Word has length 93 [2019-12-07 17:57:58,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:58,174 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 358 transitions. [2019-12-07 17:57:58,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:58,174 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 358 transitions. [2019-12-07 17:57:58,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-07 17:57:58,175 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:58,175 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:58,175 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:58,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:58,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1491212995, now seen corresponding path program 1 times [2019-12-07 17:57:58,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:58,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149639738] [2019-12-07 17:57:58,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:58,209 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:57:58,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149639738] [2019-12-07 17:57:58,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:58,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:58,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577178493] [2019-12-07 17:57:58,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:58,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:58,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:58,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:58,210 INFO L87 Difference]: Start difference. First operand 231 states and 358 transitions. Second operand 4 states. [2019-12-07 17:57:58,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:58,431 INFO L93 Difference]: Finished difference Result 468 states and 726 transitions. [2019-12-07 17:57:58,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:58,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-12-07 17:57:58,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:58,433 INFO L225 Difference]: With dead ends: 468 [2019-12-07 17:57:58,433 INFO L226 Difference]: Without dead ends: 256 [2019-12-07 17:57:58,433 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:58,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-12-07 17:57:58,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 231. [2019-12-07 17:57:58,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-12-07 17:57:58,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 357 transitions. [2019-12-07 17:57:58,437 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 357 transitions. Word has length 93 [2019-12-07 17:57:58,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:58,437 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 357 transitions. [2019-12-07 17:57:58,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:58,437 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 357 transitions. [2019-12-07 17:57:58,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 17:57:58,438 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:58,438 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:58,438 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:58,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:58,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1251508545, now seen corresponding path program 1 times [2019-12-07 17:57:58,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:58,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976366187] [2019-12-07 17:57:58,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:58,473 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:57:58,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976366187] [2019-12-07 17:57:58,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:58,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:58,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439176571] [2019-12-07 17:57:58,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:58,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:58,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:58,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:58,474 INFO L87 Difference]: Start difference. First operand 231 states and 357 transitions. Second operand 4 states. [2019-12-07 17:57:58,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:58,769 INFO L93 Difference]: Finished difference Result 499 states and 768 transitions. [2019-12-07 17:57:58,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:58,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-07 17:57:58,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:58,771 INFO L225 Difference]: With dead ends: 499 [2019-12-07 17:57:58,771 INFO L226 Difference]: Without dead ends: 287 [2019-12-07 17:57:58,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:58,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-12-07 17:57:58,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 231. [2019-12-07 17:57:58,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-12-07 17:57:58,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 356 transitions. [2019-12-07 17:57:58,775 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 356 transitions. Word has length 94 [2019-12-07 17:57:58,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:58,775 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 356 transitions. [2019-12-07 17:57:58,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:58,775 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 356 transitions. [2019-12-07 17:57:58,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 17:57:58,776 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:58,776 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:58,776 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:58,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:58,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1907256746, now seen corresponding path program 1 times [2019-12-07 17:57:58,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:58,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055217140] [2019-12-07 17:57:58,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:58,811 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:57:58,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055217140] [2019-12-07 17:57:58,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:58,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:58,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480984258] [2019-12-07 17:57:58,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:58,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:58,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:58,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:58,812 INFO L87 Difference]: Start difference. First operand 231 states and 356 transitions. Second operand 4 states. [2019-12-07 17:57:59,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:59,120 INFO L93 Difference]: Finished difference Result 497 states and 764 transitions. [2019-12-07 17:57:59,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:59,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-07 17:57:59,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:59,130 INFO L225 Difference]: With dead ends: 497 [2019-12-07 17:57:59,131 INFO L226 Difference]: Without dead ends: 285 [2019-12-07 17:57:59,131 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:59,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-12-07 17:57:59,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 231. [2019-12-07 17:57:59,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-12-07 17:57:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 355 transitions. [2019-12-07 17:57:59,136 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 355 transitions. Word has length 94 [2019-12-07 17:57:59,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:59,136 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 355 transitions. [2019-12-07 17:57:59,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:59,136 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 355 transitions. [2019-12-07 17:57:59,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 17:57:59,137 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:59,137 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:59,137 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:59,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:59,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1171911914, now seen corresponding path program 1 times [2019-12-07 17:57:59,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:59,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089435232] [2019-12-07 17:57:59,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:59,175 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:57:59,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089435232] [2019-12-07 17:57:59,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:59,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:59,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32337877] [2019-12-07 17:57:59,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:59,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:59,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:59,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:59,176 INFO L87 Difference]: Start difference. First operand 231 states and 355 transitions. Second operand 4 states. [2019-12-07 17:57:59,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:59,490 INFO L93 Difference]: Finished difference Result 496 states and 761 transitions. [2019-12-07 17:57:59,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:59,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-07 17:57:59,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:59,493 INFO L225 Difference]: With dead ends: 496 [2019-12-07 17:57:59,493 INFO L226 Difference]: Without dead ends: 284 [2019-12-07 17:57:59,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:59,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-12-07 17:57:59,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 231. [2019-12-07 17:57:59,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-12-07 17:57:59,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 354 transitions. [2019-12-07 17:57:59,498 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 354 transitions. Word has length 94 [2019-12-07 17:57:59,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:59,498 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 354 transitions. [2019-12-07 17:57:59,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:59,499 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 354 transitions. [2019-12-07 17:57:59,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 17:57:59,499 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:59,499 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:59,500 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:59,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:59,500 INFO L82 PathProgramCache]: Analyzing trace with hash 2039836755, now seen corresponding path program 1 times [2019-12-07 17:57:59,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:59,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069171161] [2019-12-07 17:57:59,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 17:57:59,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069171161] [2019-12-07 17:57:59,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:59,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:57:59,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379806021] [2019-12-07 17:57:59,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:57:59,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:59,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:57:59,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:59,549 INFO L87 Difference]: Start difference. First operand 231 states and 354 transitions. Second operand 5 states. [2019-12-07 17:57:59,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:59,860 INFO L93 Difference]: Finished difference Result 464 states and 716 transitions. [2019-12-07 17:57:59,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:57:59,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-07 17:57:59,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:59,862 INFO L225 Difference]: With dead ends: 464 [2019-12-07 17:57:59,862 INFO L226 Difference]: Without dead ends: 252 [2019-12-07 17:57:59,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:57:59,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-12-07 17:57:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2019-12-07 17:57:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-12-07 17:57:59,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 380 transitions. [2019-12-07 17:57:59,866 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 380 transitions. Word has length 94 [2019-12-07 17:57:59,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:59,866 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 380 transitions. [2019-12-07 17:57:59,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:57:59,866 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 380 transitions. [2019-12-07 17:57:59,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 17:57:59,867 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:59,867 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:59,867 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:59,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:59,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1943809876, now seen corresponding path program 1 times [2019-12-07 17:57:59,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:59,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6578661] [2019-12-07 17:57:59,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:59,898 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:57:59,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6578661] [2019-12-07 17:57:59,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:59,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:59,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316408893] [2019-12-07 17:57:59,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:59,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:59,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:59,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:59,899 INFO L87 Difference]: Start difference. First operand 251 states and 380 transitions. Second operand 4 states. [2019-12-07 17:58:00,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:00,117 INFO L93 Difference]: Finished difference Result 505 states and 766 transitions. [2019-12-07 17:58:00,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:00,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-07 17:58:00,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:00,118 INFO L225 Difference]: With dead ends: 505 [2019-12-07 17:58:00,118 INFO L226 Difference]: Without dead ends: 273 [2019-12-07 17:58:00,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:00,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-12-07 17:58:00,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 251. [2019-12-07 17:58:00,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-12-07 17:58:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 379 transitions. [2019-12-07 17:58:00,122 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 379 transitions. Word has length 94 [2019-12-07 17:58:00,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:00,123 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 379 transitions. [2019-12-07 17:58:00,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:00,123 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 379 transitions. [2019-12-07 17:58:00,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 17:58:00,123 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:00,123 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:00,123 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:00,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:00,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1615812588, now seen corresponding path program 1 times [2019-12-07 17:58:00,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:00,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505742914] [2019-12-07 17:58:00,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:00,155 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:58:00,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505742914] [2019-12-07 17:58:00,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:00,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:00,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490272934] [2019-12-07 17:58:00,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:00,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:00,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:00,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:00,156 INFO L87 Difference]: Start difference. First operand 251 states and 379 transitions. Second operand 4 states. [2019-12-07 17:58:00,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:00,367 INFO L93 Difference]: Finished difference Result 504 states and 763 transitions. [2019-12-07 17:58:00,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:00,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-07 17:58:00,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:00,369 INFO L225 Difference]: With dead ends: 504 [2019-12-07 17:58:00,369 INFO L226 Difference]: Without dead ends: 272 [2019-12-07 17:58:00,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:00,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-12-07 17:58:00,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 251. [2019-12-07 17:58:00,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-12-07 17:58:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 378 transitions. [2019-12-07 17:58:00,373 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 378 transitions. Word has length 94 [2019-12-07 17:58:00,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:00,374 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 378 transitions. [2019-12-07 17:58:00,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:00,374 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 378 transitions. [2019-12-07 17:58:00,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 17:58:00,374 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:00,374 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:00,374 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:00,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:00,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1225694591, now seen corresponding path program 1 times [2019-12-07 17:58:00,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:00,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468529860] [2019-12-07 17:58:00,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:00,413 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:58:00,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468529860] [2019-12-07 17:58:00,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:00,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:00,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224239772] [2019-12-07 17:58:00,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:00,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:00,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:00,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:00,414 INFO L87 Difference]: Start difference. First operand 251 states and 378 transitions. Second operand 4 states. [2019-12-07 17:58:00,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:00,735 INFO L93 Difference]: Finished difference Result 536 states and 806 transitions. [2019-12-07 17:58:00,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:00,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 17:58:00,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:00,736 INFO L225 Difference]: With dead ends: 536 [2019-12-07 17:58:00,736 INFO L226 Difference]: Without dead ends: 304 [2019-12-07 17:58:00,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:00,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-12-07 17:58:00,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 251. [2019-12-07 17:58:00,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-12-07 17:58:00,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 377 transitions. [2019-12-07 17:58:00,743 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 377 transitions. Word has length 95 [2019-12-07 17:58:00,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:00,743 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 377 transitions. [2019-12-07 17:58:00,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:00,743 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 377 transitions. [2019-12-07 17:58:00,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 17:58:00,744 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:00,744 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:00,744 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:00,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:00,745 INFO L82 PathProgramCache]: Analyzing trace with hash -349675585, now seen corresponding path program 1 times [2019-12-07 17:58:00,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:00,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941230820] [2019-12-07 17:58:00,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:00,782 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:58:00,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941230820] [2019-12-07 17:58:00,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:00,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:00,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338873437] [2019-12-07 17:58:00,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:00,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:00,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:00,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:00,783 INFO L87 Difference]: Start difference. First operand 251 states and 377 transitions. Second operand 4 states. [2019-12-07 17:58:00,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:00,991 INFO L93 Difference]: Finished difference Result 504 states and 759 transitions. [2019-12-07 17:58:00,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:00,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 17:58:00,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:00,993 INFO L225 Difference]: With dead ends: 504 [2019-12-07 17:58:00,993 INFO L226 Difference]: Without dead ends: 272 [2019-12-07 17:58:00,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:00,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-12-07 17:58:00,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 251. [2019-12-07 17:58:00,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-12-07 17:58:00,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 376 transitions. [2019-12-07 17:58:00,998 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 376 transitions. Word has length 95 [2019-12-07 17:58:00,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:00,998 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 376 transitions. [2019-12-07 17:58:00,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:00,998 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 376 transitions. [2019-12-07 17:58:00,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 17:58:00,999 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:00,999 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:01,000 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:01,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:01,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1893169626, now seen corresponding path program 1 times [2019-12-07 17:58:01,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:01,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651041093] [2019-12-07 17:58:01,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:01,042 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:58:01,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651041093] [2019-12-07 17:58:01,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:01,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:01,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144955740] [2019-12-07 17:58:01,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:01,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:01,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:01,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:01,043 INFO L87 Difference]: Start difference. First operand 251 states and 376 transitions. Second operand 4 states. [2019-12-07 17:58:01,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:01,332 INFO L93 Difference]: Finished difference Result 536 states and 802 transitions. [2019-12-07 17:58:01,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:01,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 17:58:01,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:01,334 INFO L225 Difference]: With dead ends: 536 [2019-12-07 17:58:01,334 INFO L226 Difference]: Without dead ends: 304 [2019-12-07 17:58:01,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:01,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-12-07 17:58:01,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 251. [2019-12-07 17:58:01,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-12-07 17:58:01,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 375 transitions. [2019-12-07 17:58:01,338 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 375 transitions. Word has length 96 [2019-12-07 17:58:01,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:01,338 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 375 transitions. [2019-12-07 17:58:01,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:01,338 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 375 transitions. [2019-12-07 17:58:01,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 17:58:01,339 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:01,339 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:01,339 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:01,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:01,339 INFO L82 PathProgramCache]: Analyzing trace with hash -506384216, now seen corresponding path program 1 times [2019-12-07 17:58:01,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:01,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844131132] [2019-12-07 17:58:01,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:58:01,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844131132] [2019-12-07 17:58:01,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:01,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:01,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738006990] [2019-12-07 17:58:01,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:01,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:01,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:01,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:01,379 INFO L87 Difference]: Start difference. First operand 251 states and 375 transitions. Second operand 4 states. [2019-12-07 17:58:01,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:01,605 INFO L93 Difference]: Finished difference Result 504 states and 755 transitions. [2019-12-07 17:58:01,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:01,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 17:58:01,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:01,606 INFO L225 Difference]: With dead ends: 504 [2019-12-07 17:58:01,607 INFO L226 Difference]: Without dead ends: 272 [2019-12-07 17:58:01,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:01,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-12-07 17:58:01,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 251. [2019-12-07 17:58:01,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-12-07 17:58:01,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 374 transitions. [2019-12-07 17:58:01,611 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 374 transitions. Word has length 96 [2019-12-07 17:58:01,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:01,611 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 374 transitions. [2019-12-07 17:58:01,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:01,611 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 374 transitions. [2019-12-07 17:58:01,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 17:58:01,612 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:01,612 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:01,612 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:01,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:01,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1563138876, now seen corresponding path program 1 times [2019-12-07 17:58:01,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:01,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921223235] [2019-12-07 17:58:01,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:01,647 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:58:01,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921223235] [2019-12-07 17:58:01,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:01,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:01,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582461819] [2019-12-07 17:58:01,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:01,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:01,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:01,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:01,648 INFO L87 Difference]: Start difference. First operand 251 states and 374 transitions. Second operand 4 states. [2019-12-07 17:58:01,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:01,917 INFO L93 Difference]: Finished difference Result 536 states and 798 transitions. [2019-12-07 17:58:01,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:01,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 17:58:01,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:01,919 INFO L225 Difference]: With dead ends: 536 [2019-12-07 17:58:01,919 INFO L226 Difference]: Without dead ends: 304 [2019-12-07 17:58:01,919 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:01,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-12-07 17:58:01,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 251. [2019-12-07 17:58:01,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-12-07 17:58:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 373 transitions. [2019-12-07 17:58:01,923 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 373 transitions. Word has length 97 [2019-12-07 17:58:01,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:01,924 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 373 transitions. [2019-12-07 17:58:01,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 373 transitions. [2019-12-07 17:58:01,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 17:58:01,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:01,924 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:01,924 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:01,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:01,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1603813626, now seen corresponding path program 1 times [2019-12-07 17:58:01,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:01,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184930178] [2019-12-07 17:58:01,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:01,957 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:58:01,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184930178] [2019-12-07 17:58:01,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:01,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:01,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148744426] [2019-12-07 17:58:01,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:01,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:01,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:01,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:01,959 INFO L87 Difference]: Start difference. First operand 251 states and 373 transitions. Second operand 4 states. [2019-12-07 17:58:02,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:02,193 INFO L93 Difference]: Finished difference Result 504 states and 751 transitions. [2019-12-07 17:58:02,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:02,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 17:58:02,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:02,194 INFO L225 Difference]: With dead ends: 504 [2019-12-07 17:58:02,194 INFO L226 Difference]: Without dead ends: 272 [2019-12-07 17:58:02,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:02,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-12-07 17:58:02,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 251. [2019-12-07 17:58:02,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-12-07 17:58:02,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 372 transitions. [2019-12-07 17:58:02,199 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 372 transitions. Word has length 97 [2019-12-07 17:58:02,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:02,199 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 372 transitions. [2019-12-07 17:58:02,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:02,199 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 372 transitions. [2019-12-07 17:58:02,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 17:58:02,199 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:02,199 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:02,200 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:02,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:02,200 INFO L82 PathProgramCache]: Analyzing trace with hash -287249151, now seen corresponding path program 1 times [2019-12-07 17:58:02,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:02,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273075645] [2019-12-07 17:58:02,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:02,231 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:58:02,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273075645] [2019-12-07 17:58:02,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:02,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:02,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903707217] [2019-12-07 17:58:02,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:02,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:02,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:02,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:02,232 INFO L87 Difference]: Start difference. First operand 251 states and 372 transitions. Second operand 4 states. [2019-12-07 17:58:02,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:02,518 INFO L93 Difference]: Finished difference Result 526 states and 782 transitions. [2019-12-07 17:58:02,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:02,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 17:58:02,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:02,520 INFO L225 Difference]: With dead ends: 526 [2019-12-07 17:58:02,520 INFO L226 Difference]: Without dead ends: 294 [2019-12-07 17:58:02,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:02,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-12-07 17:58:02,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 251. [2019-12-07 17:58:02,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-12-07 17:58:02,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 371 transitions. [2019-12-07 17:58:02,524 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 371 transitions. Word has length 98 [2019-12-07 17:58:02,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:02,524 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 371 transitions. [2019-12-07 17:58:02,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:02,524 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 371 transitions. [2019-12-07 17:58:02,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 17:58:02,525 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:02,525 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:02,525 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:02,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:02,525 INFO L82 PathProgramCache]: Analyzing trace with hash 973668099, now seen corresponding path program 1 times [2019-12-07 17:58:02,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:02,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437041830] [2019-12-07 17:58:02,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:58:02,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437041830] [2019-12-07 17:58:02,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:02,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:02,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522396792] [2019-12-07 17:58:02,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:02,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:02,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:02,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:02,566 INFO L87 Difference]: Start difference. First operand 251 states and 371 transitions. Second operand 4 states. [2019-12-07 17:58:02,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:02,770 INFO L93 Difference]: Finished difference Result 494 states and 735 transitions. [2019-12-07 17:58:02,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:02,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 17:58:02,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:02,779 INFO L225 Difference]: With dead ends: 494 [2019-12-07 17:58:02,779 INFO L226 Difference]: Without dead ends: 262 [2019-12-07 17:58:02,779 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:02,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-12-07 17:58:02,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 251. [2019-12-07 17:58:02,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-12-07 17:58:02,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 370 transitions. [2019-12-07 17:58:02,783 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 370 transitions. Word has length 98 [2019-12-07 17:58:02,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:02,783 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 370 transitions. [2019-12-07 17:58:02,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:02,783 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 370 transitions. [2019-12-07 17:58:02,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 17:58:02,784 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:02,784 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:02,784 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:02,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:02,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1584535859, now seen corresponding path program 1 times [2019-12-07 17:58:02,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:02,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504529220] [2019-12-07 17:58:02,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:02,817 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:58:02,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504529220] [2019-12-07 17:58:02,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:02,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:02,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703121600] [2019-12-07 17:58:02,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:02,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:02,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:02,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:02,818 INFO L87 Difference]: Start difference. First operand 251 states and 370 transitions. Second operand 4 states. [2019-12-07 17:58:03,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:03,092 INFO L93 Difference]: Finished difference Result 526 states and 778 transitions. [2019-12-07 17:58:03,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:03,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-07 17:58:03,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:03,093 INFO L225 Difference]: With dead ends: 526 [2019-12-07 17:58:03,093 INFO L226 Difference]: Without dead ends: 294 [2019-12-07 17:58:03,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:03,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-12-07 17:58:03,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 251. [2019-12-07 17:58:03,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-12-07 17:58:03,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 369 transitions. [2019-12-07 17:58:03,099 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 369 transitions. Word has length 102 [2019-12-07 17:58:03,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:03,100 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 369 transitions. [2019-12-07 17:58:03,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:03,100 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 369 transitions. [2019-12-07 17:58:03,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 17:58:03,100 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:03,101 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:03,101 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:03,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:03,101 INFO L82 PathProgramCache]: Analyzing trace with hash 377038799, now seen corresponding path program 1 times [2019-12-07 17:58:03,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:03,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345392403] [2019-12-07 17:58:03,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:03,143 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:58:03,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345392403] [2019-12-07 17:58:03,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:03,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:03,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256849102] [2019-12-07 17:58:03,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:03,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:03,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:03,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:03,144 INFO L87 Difference]: Start difference. First operand 251 states and 369 transitions. Second operand 4 states. [2019-12-07 17:58:03,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:03,395 INFO L93 Difference]: Finished difference Result 535 states and 795 transitions. [2019-12-07 17:58:03,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:03,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-07 17:58:03,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:03,397 INFO L225 Difference]: With dead ends: 535 [2019-12-07 17:58:03,397 INFO L226 Difference]: Without dead ends: 303 [2019-12-07 17:58:03,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:03,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-12-07 17:58:03,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 277. [2019-12-07 17:58:03,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-12-07 17:58:03,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 414 transitions. [2019-12-07 17:58:03,401 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 414 transitions. Word has length 102 [2019-12-07 17:58:03,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:03,401 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 414 transitions. [2019-12-07 17:58:03,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:03,401 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 414 transitions. [2019-12-07 17:58:03,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 17:58:03,402 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:03,402 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:03,402 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:03,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:03,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1906049320, now seen corresponding path program 1 times [2019-12-07 17:58:03,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:03,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831424643] [2019-12-07 17:58:03,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:03,439 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:58:03,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831424643] [2019-12-07 17:58:03,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:03,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:03,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660938477] [2019-12-07 17:58:03,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:03,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:03,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:03,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:03,440 INFO L87 Difference]: Start difference. First operand 277 states and 414 transitions. Second operand 4 states. [2019-12-07 17:58:03,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:03,694 INFO L93 Difference]: Finished difference Result 578 states and 866 transitions. [2019-12-07 17:58:03,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:03,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-12-07 17:58:03,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:03,695 INFO L225 Difference]: With dead ends: 578 [2019-12-07 17:58:03,695 INFO L226 Difference]: Without dead ends: 320 [2019-12-07 17:58:03,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:03,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-12-07 17:58:03,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 277. [2019-12-07 17:58:03,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-12-07 17:58:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 413 transitions. [2019-12-07 17:58:03,700 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 413 transitions. Word has length 105 [2019-12-07 17:58:03,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:03,700 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 413 transitions. [2019-12-07 17:58:03,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:03,700 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 413 transitions. [2019-12-07 17:58:03,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-07 17:58:03,701 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:03,701 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:03,701 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:03,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:03,701 INFO L82 PathProgramCache]: Analyzing trace with hash -560376435, now seen corresponding path program 1 times [2019-12-07 17:58:03,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:03,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025611082] [2019-12-07 17:58:03,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:58:03,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025611082] [2019-12-07 17:58:03,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:03,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:03,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806330160] [2019-12-07 17:58:03,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:03,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:03,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:03,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:03,752 INFO L87 Difference]: Start difference. First operand 277 states and 413 transitions. Second operand 4 states. [2019-12-07 17:58:03,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:03,985 INFO L93 Difference]: Finished difference Result 570 states and 851 transitions. [2019-12-07 17:58:03,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:03,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-12-07 17:58:03,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:03,987 INFO L225 Difference]: With dead ends: 570 [2019-12-07 17:58:03,987 INFO L226 Difference]: Without dead ends: 312 [2019-12-07 17:58:03,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:03,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-12-07 17:58:03,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 277. [2019-12-07 17:58:03,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-12-07 17:58:03,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 412 transitions. [2019-12-07 17:58:03,991 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 412 transitions. Word has length 106 [2019-12-07 17:58:03,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:03,991 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 412 transitions. [2019-12-07 17:58:03,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:03,992 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 412 transitions. [2019-12-07 17:58:03,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-12-07 17:58:03,992 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:03,992 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:03,992 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:03,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:03,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1855377922, now seen corresponding path program 1 times [2019-12-07 17:58:03,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:03,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34687388] [2019-12-07 17:58:03,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:04,029 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:58:04,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34687388] [2019-12-07 17:58:04,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:04,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:04,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675003493] [2019-12-07 17:58:04,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:04,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:04,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:04,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:04,030 INFO L87 Difference]: Start difference. First operand 277 states and 412 transitions. Second operand 4 states. [2019-12-07 17:58:04,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:04,280 INFO L93 Difference]: Finished difference Result 570 states and 849 transitions. [2019-12-07 17:58:04,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:04,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-12-07 17:58:04,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:04,281 INFO L225 Difference]: With dead ends: 570 [2019-12-07 17:58:04,282 INFO L226 Difference]: Without dead ends: 312 [2019-12-07 17:58:04,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:04,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-12-07 17:58:04,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 277. [2019-12-07 17:58:04,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-12-07 17:58:04,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 411 transitions. [2019-12-07 17:58:04,286 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 411 transitions. Word has length 107 [2019-12-07 17:58:04,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:04,286 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 411 transitions. [2019-12-07 17:58:04,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:04,286 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 411 transitions. [2019-12-07 17:58:04,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-12-07 17:58:04,287 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:04,287 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:04,287 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:04,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:04,287 INFO L82 PathProgramCache]: Analyzing trace with hash 705844290, now seen corresponding path program 1 times [2019-12-07 17:58:04,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:04,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617762559] [2019-12-07 17:58:04,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:04,325 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:58:04,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617762559] [2019-12-07 17:58:04,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:04,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:04,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425848892] [2019-12-07 17:58:04,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:04,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:04,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:04,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:04,327 INFO L87 Difference]: Start difference. First operand 277 states and 411 transitions. Second operand 4 states. [2019-12-07 17:58:04,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:04,585 INFO L93 Difference]: Finished difference Result 570 states and 847 transitions. [2019-12-07 17:58:04,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:04,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-12-07 17:58:04,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:04,587 INFO L225 Difference]: With dead ends: 570 [2019-12-07 17:58:04,587 INFO L226 Difference]: Without dead ends: 312 [2019-12-07 17:58:04,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:04,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-12-07 17:58:04,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 277. [2019-12-07 17:58:04,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-12-07 17:58:04,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 410 transitions. [2019-12-07 17:58:04,593 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 410 transitions. Word has length 108 [2019-12-07 17:58:04,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:04,593 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 410 transitions. [2019-12-07 17:58:04,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 410 transitions. [2019-12-07 17:58:04,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-12-07 17:58:04,594 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:04,594 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:04,594 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:04,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:04,594 INFO L82 PathProgramCache]: Analyzing trace with hash 71773319, now seen corresponding path program 1 times [2019-12-07 17:58:04,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:04,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57795604] [2019-12-07 17:58:04,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:04,632 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:58:04,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57795604] [2019-12-07 17:58:04,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:04,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:04,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974821169] [2019-12-07 17:58:04,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:04,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:04,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:04,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:04,633 INFO L87 Difference]: Start difference. First operand 277 states and 410 transitions. Second operand 4 states. [2019-12-07 17:58:04,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:04,881 INFO L93 Difference]: Finished difference Result 568 states and 843 transitions. [2019-12-07 17:58:04,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:04,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-12-07 17:58:04,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:04,883 INFO L225 Difference]: With dead ends: 568 [2019-12-07 17:58:04,883 INFO L226 Difference]: Without dead ends: 310 [2019-12-07 17:58:04,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:04,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-12-07 17:58:04,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 277. [2019-12-07 17:58:04,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-12-07 17:58:04,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 409 transitions. [2019-12-07 17:58:04,887 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 409 transitions. Word has length 108 [2019-12-07 17:58:04,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:04,888 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 409 transitions. [2019-12-07 17:58:04,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:04,888 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 409 transitions. [2019-12-07 17:58:04,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-07 17:58:04,888 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:04,888 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:04,888 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:04,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:04,889 INFO L82 PathProgramCache]: Analyzing trace with hash 493695261, now seen corresponding path program 1 times [2019-12-07 17:58:04,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:04,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028147672] [2019-12-07 17:58:04,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:58:04,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028147672] [2019-12-07 17:58:04,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:04,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:04,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660705194] [2019-12-07 17:58:04,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:04,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:04,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:04,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:04,927 INFO L87 Difference]: Start difference. First operand 277 states and 409 transitions. Second operand 4 states. [2019-12-07 17:58:05,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:05,161 INFO L93 Difference]: Finished difference Result 566 states and 838 transitions. [2019-12-07 17:58:05,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:05,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-12-07 17:58:05,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:05,162 INFO L225 Difference]: With dead ends: 566 [2019-12-07 17:58:05,162 INFO L226 Difference]: Without dead ends: 308 [2019-12-07 17:58:05,163 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:05,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-12-07 17:58:05,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 277. [2019-12-07 17:58:05,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-12-07 17:58:05,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 408 transitions. [2019-12-07 17:58:05,169 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 408 transitions. Word has length 109 [2019-12-07 17:58:05,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:05,169 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 408 transitions. [2019-12-07 17:58:05,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:05,170 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 408 transitions. [2019-12-07 17:58:05,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-07 17:58:05,170 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:05,170 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:05,171 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:05,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:05,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1501118240, now seen corresponding path program 1 times [2019-12-07 17:58:05,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:05,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144192599] [2019-12-07 17:58:05,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:05,210 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:58:05,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144192599] [2019-12-07 17:58:05,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:05,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:05,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268796536] [2019-12-07 17:58:05,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:05,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:05,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:05,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:05,211 INFO L87 Difference]: Start difference. First operand 277 states and 408 transitions. Second operand 4 states. [2019-12-07 17:58:05,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:05,446 INFO L93 Difference]: Finished difference Result 563 states and 832 transitions. [2019-12-07 17:58:05,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:05,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-12-07 17:58:05,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:05,448 INFO L225 Difference]: With dead ends: 563 [2019-12-07 17:58:05,448 INFO L226 Difference]: Without dead ends: 305 [2019-12-07 17:58:05,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:05,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-12-07 17:58:05,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 277. [2019-12-07 17:58:05,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-12-07 17:58:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 407 transitions. [2019-12-07 17:58:05,453 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 407 transitions. Word has length 109 [2019-12-07 17:58:05,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:05,453 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 407 transitions. [2019-12-07 17:58:05,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:05,453 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 407 transitions. [2019-12-07 17:58:05,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-07 17:58:05,453 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:05,453 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:05,453 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:05,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:05,454 INFO L82 PathProgramCache]: Analyzing trace with hash 2063467681, now seen corresponding path program 1 times [2019-12-07 17:58:05,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:05,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745745658] [2019-12-07 17:58:05,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:58:05,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745745658] [2019-12-07 17:58:05,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:05,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:05,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691879680] [2019-12-07 17:58:05,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:05,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:05,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:05,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:05,492 INFO L87 Difference]: Start difference. First operand 277 states and 407 transitions. Second operand 4 states. [2019-12-07 17:58:05,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:05,732 INFO L93 Difference]: Finished difference Result 563 states and 830 transitions. [2019-12-07 17:58:05,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:05,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-12-07 17:58:05,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:05,733 INFO L225 Difference]: With dead ends: 563 [2019-12-07 17:58:05,733 INFO L226 Difference]: Without dead ends: 305 [2019-12-07 17:58:05,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:05,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-12-07 17:58:05,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 277. [2019-12-07 17:58:05,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-12-07 17:58:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 406 transitions. [2019-12-07 17:58:05,738 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 406 transitions. Word has length 111 [2019-12-07 17:58:05,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:05,738 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 406 transitions. [2019-12-07 17:58:05,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:05,738 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 406 transitions. [2019-12-07 17:58:05,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 17:58:05,739 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:05,739 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:05,739 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:05,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:05,739 INFO L82 PathProgramCache]: Analyzing trace with hash 312844043, now seen corresponding path program 1 times [2019-12-07 17:58:05,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:05,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908360493] [2019-12-07 17:58:05,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:58:05,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908360493] [2019-12-07 17:58:05,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:05,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:05,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065425707] [2019-12-07 17:58:05,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:05,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:05,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:05,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:05,782 INFO L87 Difference]: Start difference. First operand 277 states and 406 transitions. Second operand 4 states. [2019-12-07 17:58:06,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:06,020 INFO L93 Difference]: Finished difference Result 559 states and 823 transitions. [2019-12-07 17:58:06,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:06,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-12-07 17:58:06,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:06,022 INFO L225 Difference]: With dead ends: 559 [2019-12-07 17:58:06,022 INFO L226 Difference]: Without dead ends: 301 [2019-12-07 17:58:06,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:06,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-07 17:58:06,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 277. [2019-12-07 17:58:06,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-12-07 17:58:06,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 405 transitions. [2019-12-07 17:58:06,027 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 405 transitions. Word has length 112 [2019-12-07 17:58:06,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:06,027 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 405 transitions. [2019-12-07 17:58:06,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:06,027 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 405 transitions. [2019-12-07 17:58:06,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 17:58:06,028 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:06,028 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:06,028 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:06,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:06,028 INFO L82 PathProgramCache]: Analyzing trace with hash -692198915, now seen corresponding path program 1 times [2019-12-07 17:58:06,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:06,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519965197] [2019-12-07 17:58:06,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:06,069 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:58:06,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519965197] [2019-12-07 17:58:06,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:06,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:06,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928766488] [2019-12-07 17:58:06,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:06,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:06,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:06,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:06,070 INFO L87 Difference]: Start difference. First operand 277 states and 405 transitions. Second operand 4 states. [2019-12-07 17:58:06,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:06,320 INFO L93 Difference]: Finished difference Result 559 states and 821 transitions. [2019-12-07 17:58:06,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:06,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-12-07 17:58:06,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:06,322 INFO L225 Difference]: With dead ends: 559 [2019-12-07 17:58:06,322 INFO L226 Difference]: Without dead ends: 301 [2019-12-07 17:58:06,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:06,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-07 17:58:06,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 277. [2019-12-07 17:58:06,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-12-07 17:58:06,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 404 transitions. [2019-12-07 17:58:06,327 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 404 transitions. Word has length 112 [2019-12-07 17:58:06,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:06,327 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 404 transitions. [2019-12-07 17:58:06,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:06,327 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 404 transitions. [2019-12-07 17:58:06,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 17:58:06,327 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:06,328 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:06,328 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:06,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:06,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1497358285, now seen corresponding path program 1 times [2019-12-07 17:58:06,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:06,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070296400] [2019-12-07 17:58:06,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:06,367 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:58:06,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070296400] [2019-12-07 17:58:06,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:06,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:06,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931624165] [2019-12-07 17:58:06,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:06,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:06,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:06,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:06,368 INFO L87 Difference]: Start difference. First operand 277 states and 404 transitions. Second operand 4 states. [2019-12-07 17:58:06,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:06,604 INFO L93 Difference]: Finished difference Result 557 states and 817 transitions. [2019-12-07 17:58:06,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:06,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-12-07 17:58:06,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:06,606 INFO L225 Difference]: With dead ends: 557 [2019-12-07 17:58:06,606 INFO L226 Difference]: Without dead ends: 299 [2019-12-07 17:58:06,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:06,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-12-07 17:58:06,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 277. [2019-12-07 17:58:06,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-12-07 17:58:06,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 403 transitions. [2019-12-07 17:58:06,610 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 403 transitions. Word has length 113 [2019-12-07 17:58:06,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:06,611 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 403 transitions. [2019-12-07 17:58:06,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:06,611 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 403 transitions. [2019-12-07 17:58:06,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-07 17:58:06,611 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:06,611 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:06,611 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:06,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:06,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1293653960, now seen corresponding path program 1 times [2019-12-07 17:58:06,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:06,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883575246] [2019-12-07 17:58:06,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:06,655 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:58:06,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883575246] [2019-12-07 17:58:06,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:06,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:06,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381381559] [2019-12-07 17:58:06,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:06,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:06,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:06,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:06,656 INFO L87 Difference]: Start difference. First operand 277 states and 403 transitions. Second operand 4 states. [2019-12-07 17:58:06,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:06,882 INFO L93 Difference]: Finished difference Result 557 states and 815 transitions. [2019-12-07 17:58:06,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:06,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-12-07 17:58:06,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:06,884 INFO L225 Difference]: With dead ends: 557 [2019-12-07 17:58:06,884 INFO L226 Difference]: Without dead ends: 299 [2019-12-07 17:58:06,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:06,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-12-07 17:58:06,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 277. [2019-12-07 17:58:06,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-12-07 17:58:06,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 402 transitions. [2019-12-07 17:58:06,889 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 402 transitions. Word has length 114 [2019-12-07 17:58:06,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:06,890 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 402 transitions. [2019-12-07 17:58:06,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:06,890 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 402 transitions. [2019-12-07 17:58:06,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 17:58:06,890 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:06,890 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:06,890 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:06,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:06,891 INFO L82 PathProgramCache]: Analyzing trace with hash -33129394, now seen corresponding path program 1 times [2019-12-07 17:58:06,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:06,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909480527] [2019-12-07 17:58:06,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:06,933 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:58:06,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909480527] [2019-12-07 17:58:06,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:06,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:06,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647955555] [2019-12-07 17:58:06,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:06,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:06,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:06,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:06,934 INFO L87 Difference]: Start difference. First operand 277 states and 402 transitions. Second operand 4 states. [2019-12-07 17:58:07,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:07,154 INFO L93 Difference]: Finished difference Result 555 states and 811 transitions. [2019-12-07 17:58:07,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:07,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-12-07 17:58:07,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:07,155 INFO L225 Difference]: With dead ends: 555 [2019-12-07 17:58:07,156 INFO L226 Difference]: Without dead ends: 297 [2019-12-07 17:58:07,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:07,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-12-07 17:58:07,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 277. [2019-12-07 17:58:07,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-12-07 17:58:07,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 401 transitions. [2019-12-07 17:58:07,160 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 401 transitions. Word has length 115 [2019-12-07 17:58:07,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:07,161 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 401 transitions. [2019-12-07 17:58:07,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:07,161 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 401 transitions. [2019-12-07 17:58:07,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 17:58:07,161 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:07,161 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:07,161 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:07,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:07,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1623272394, now seen corresponding path program 1 times [2019-12-07 17:58:07,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:07,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181458940] [2019-12-07 17:58:07,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:07,200 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-12-07 17:58:07,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181458940] [2019-12-07 17:58:07,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:07,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:07,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711954131] [2019-12-07 17:58:07,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:07,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:07,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:07,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:07,201 INFO L87 Difference]: Start difference. First operand 277 states and 401 transitions. Second operand 4 states. [2019-12-07 17:58:07,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:07,459 INFO L93 Difference]: Finished difference Result 606 states and 890 transitions. [2019-12-07 17:58:07,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:07,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-12-07 17:58:07,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:07,461 INFO L225 Difference]: With dead ends: 606 [2019-12-07 17:58:07,461 INFO L226 Difference]: Without dead ends: 348 [2019-12-07 17:58:07,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:07,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-12-07 17:58:07,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 309. [2019-12-07 17:58:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-12-07 17:58:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 458 transitions. [2019-12-07 17:58:07,466 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 458 transitions. Word has length 115 [2019-12-07 17:58:07,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:07,466 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 458 transitions. [2019-12-07 17:58:07,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:07,466 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 458 transitions. [2019-12-07 17:58:07,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-07 17:58:07,467 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:07,467 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:07,467 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:07,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:07,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1414686661, now seen corresponding path program 1 times [2019-12-07 17:58:07,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:07,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076649736] [2019-12-07 17:58:07,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:07,503 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:58:07,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076649736] [2019-12-07 17:58:07,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:07,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:07,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867732105] [2019-12-07 17:58:07,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:07,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:07,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:07,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:07,504 INFO L87 Difference]: Start difference. First operand 309 states and 458 transitions. Second operand 4 states. [2019-12-07 17:58:07,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:07,818 INFO L93 Difference]: Finished difference Result 701 states and 1050 transitions. [2019-12-07 17:58:07,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:07,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-12-07 17:58:07,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:07,821 INFO L225 Difference]: With dead ends: 701 [2019-12-07 17:58:07,821 INFO L226 Difference]: Without dead ends: 411 [2019-12-07 17:58:07,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:07,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-12-07 17:58:07,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 348. [2019-12-07 17:58:07,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-12-07 17:58:07,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 529 transitions. [2019-12-07 17:58:07,827 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 529 transitions. Word has length 116 [2019-12-07 17:58:07,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:07,827 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 529 transitions. [2019-12-07 17:58:07,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:07,827 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 529 transitions. [2019-12-07 17:58:07,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 17:58:07,827 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:07,828 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:07,828 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:07,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:07,828 INFO L82 PathProgramCache]: Analyzing trace with hash 899080889, now seen corresponding path program 1 times [2019-12-07 17:58:07,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:07,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391292817] [2019-12-07 17:58:07,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:07,864 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:58:07,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391292817] [2019-12-07 17:58:07,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:07,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:07,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021871768] [2019-12-07 17:58:07,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:07,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:07,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:07,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:07,865 INFO L87 Difference]: Start difference. First operand 348 states and 529 transitions. Second operand 4 states. [2019-12-07 17:58:08,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:08,217 INFO L93 Difference]: Finished difference Result 734 states and 1113 transitions. [2019-12-07 17:58:08,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:08,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-12-07 17:58:08,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:08,219 INFO L225 Difference]: With dead ends: 734 [2019-12-07 17:58:08,219 INFO L226 Difference]: Without dead ends: 405 [2019-12-07 17:58:08,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:08,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-12-07 17:58:08,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 347. [2019-12-07 17:58:08,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-12-07 17:58:08,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 528 transitions. [2019-12-07 17:58:08,225 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 528 transitions. Word has length 117 [2019-12-07 17:58:08,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:08,225 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 528 transitions. [2019-12-07 17:58:08,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:08,226 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 528 transitions. [2019-12-07 17:58:08,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 17:58:08,226 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:08,226 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:08,226 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:08,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:08,227 INFO L82 PathProgramCache]: Analyzing trace with hash 2005355270, now seen corresponding path program 1 times [2019-12-07 17:58:08,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:08,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576337168] [2019-12-07 17:58:08,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:08,262 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:58:08,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576337168] [2019-12-07 17:58:08,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:08,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:08,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117582907] [2019-12-07 17:58:08,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:08,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:08,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:08,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:08,263 INFO L87 Difference]: Start difference. First operand 347 states and 528 transitions. Second operand 4 states. [2019-12-07 17:58:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:08,479 INFO L93 Difference]: Finished difference Result 701 states and 1067 transitions. [2019-12-07 17:58:08,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:08,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-12-07 17:58:08,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:08,481 INFO L225 Difference]: With dead ends: 701 [2019-12-07 17:58:08,481 INFO L226 Difference]: Without dead ends: 373 [2019-12-07 17:58:08,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:08,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-12-07 17:58:08,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 347. [2019-12-07 17:58:08,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-12-07 17:58:08,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 527 transitions. [2019-12-07 17:58:08,487 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 527 transitions. Word has length 117 [2019-12-07 17:58:08,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:08,487 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 527 transitions. [2019-12-07 17:58:08,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:08,487 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 527 transitions. [2019-12-07 17:58:08,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 17:58:08,488 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:08,488 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:08,488 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:08,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:08,488 INFO L82 PathProgramCache]: Analyzing trace with hash -514871743, now seen corresponding path program 1 times [2019-12-07 17:58:08,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:08,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862552032] [2019-12-07 17:58:08,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:58:08,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862552032] [2019-12-07 17:58:08,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:08,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:08,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274457695] [2019-12-07 17:58:08,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:08,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:08,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:08,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:08,528 INFO L87 Difference]: Start difference. First operand 347 states and 527 transitions. Second operand 4 states. [2019-12-07 17:58:08,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:08,750 INFO L93 Difference]: Finished difference Result 701 states and 1065 transitions. [2019-12-07 17:58:08,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:08,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-12-07 17:58:08,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:08,751 INFO L225 Difference]: With dead ends: 701 [2019-12-07 17:58:08,752 INFO L226 Difference]: Without dead ends: 373 [2019-12-07 17:58:08,752 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:08,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-12-07 17:58:08,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 347. [2019-12-07 17:58:08,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-12-07 17:58:08,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 526 transitions. [2019-12-07 17:58:08,757 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 526 transitions. Word has length 118 [2019-12-07 17:58:08,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:08,757 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 526 transitions. [2019-12-07 17:58:08,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:08,758 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 526 transitions. [2019-12-07 17:58:08,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-07 17:58:08,758 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:08,758 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:08,758 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:08,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:08,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1340700289, now seen corresponding path program 1 times [2019-12-07 17:58:08,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:08,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81501215] [2019-12-07 17:58:08,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:58:08,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81501215] [2019-12-07 17:58:08,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:08,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:08,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689842170] [2019-12-07 17:58:08,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:08,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:08,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:08,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:08,793 INFO L87 Difference]: Start difference. First operand 347 states and 526 transitions. Second operand 4 states. [2019-12-07 17:58:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:09,027 INFO L93 Difference]: Finished difference Result 701 states and 1063 transitions. [2019-12-07 17:58:09,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:09,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-12-07 17:58:09,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:09,029 INFO L225 Difference]: With dead ends: 701 [2019-12-07 17:58:09,029 INFO L226 Difference]: Without dead ends: 373 [2019-12-07 17:58:09,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:09,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-12-07 17:58:09,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 347. [2019-12-07 17:58:09,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-12-07 17:58:09,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 525 transitions. [2019-12-07 17:58:09,035 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 525 transitions. Word has length 119 [2019-12-07 17:58:09,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:09,035 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 525 transitions. [2019-12-07 17:58:09,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:09,035 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 525 transitions. [2019-12-07 17:58:09,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-07 17:58:09,036 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:09,036 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:09,036 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:09,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:09,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1407089244, now seen corresponding path program 1 times [2019-12-07 17:58:09,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:09,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350320287] [2019-12-07 17:58:09,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:09,071 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:58:09,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350320287] [2019-12-07 17:58:09,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:09,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:09,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359240102] [2019-12-07 17:58:09,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:09,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:09,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:09,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:09,072 INFO L87 Difference]: Start difference. First operand 347 states and 525 transitions. Second operand 4 states. [2019-12-07 17:58:09,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:09,291 INFO L93 Difference]: Finished difference Result 691 states and 1049 transitions. [2019-12-07 17:58:09,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:09,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-12-07 17:58:09,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:09,292 INFO L225 Difference]: With dead ends: 691 [2019-12-07 17:58:09,292 INFO L226 Difference]: Without dead ends: 363 [2019-12-07 17:58:09,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:09,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-12-07 17:58:09,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 347. [2019-12-07 17:58:09,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-12-07 17:58:09,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 524 transitions. [2019-12-07 17:58:09,299 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 524 transitions. Word has length 120 [2019-12-07 17:58:09,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:09,299 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 524 transitions. [2019-12-07 17:58:09,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:09,299 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 524 transitions. [2019-12-07 17:58:09,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 17:58:09,299 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:09,299 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:09,300 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:09,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:09,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1158786148, now seen corresponding path program 1 times [2019-12-07 17:58:09,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:09,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808484841] [2019-12-07 17:58:09,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:09,337 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:58:09,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808484841] [2019-12-07 17:58:09,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:09,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:09,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648044846] [2019-12-07 17:58:09,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:09,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:09,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:09,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:09,338 INFO L87 Difference]: Start difference. First operand 347 states and 524 transitions. Second operand 4 states. [2019-12-07 17:58:09,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:09,649 INFO L93 Difference]: Finished difference Result 777 states and 1182 transitions. [2019-12-07 17:58:09,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:09,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-12-07 17:58:09,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:09,651 INFO L225 Difference]: With dead ends: 777 [2019-12-07 17:58:09,651 INFO L226 Difference]: Without dead ends: 449 [2019-12-07 17:58:09,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:09,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-12-07 17:58:09,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 386. [2019-12-07 17:58:09,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-12-07 17:58:09,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 595 transitions. [2019-12-07 17:58:09,658 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 595 transitions. Word has length 121 [2019-12-07 17:58:09,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:09,659 INFO L462 AbstractCegarLoop]: Abstraction has 386 states and 595 transitions. [2019-12-07 17:58:09,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:09,659 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 595 transitions. [2019-12-07 17:58:09,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-07 17:58:09,659 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:09,659 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:09,659 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:09,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:09,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1569164862, now seen corresponding path program 1 times [2019-12-07 17:58:09,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:09,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643266490] [2019-12-07 17:58:09,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:09,698 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:58:09,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643266490] [2019-12-07 17:58:09,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:09,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:09,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430602665] [2019-12-07 17:58:09,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:09,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:09,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:09,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:09,699 INFO L87 Difference]: Start difference. First operand 386 states and 595 transitions. Second operand 4 states. [2019-12-07 17:58:10,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:10,073 INFO L93 Difference]: Finished difference Result 810 states and 1245 transitions. [2019-12-07 17:58:10,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:10,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-12-07 17:58:10,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:10,075 INFO L225 Difference]: With dead ends: 810 [2019-12-07 17:58:10,075 INFO L226 Difference]: Without dead ends: 443 [2019-12-07 17:58:10,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:10,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-12-07 17:58:10,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 347. [2019-12-07 17:58:10,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-12-07 17:58:10,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 524 transitions. [2019-12-07 17:58:10,082 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 524 transitions. Word has length 122 [2019-12-07 17:58:10,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:10,083 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 524 transitions. [2019-12-07 17:58:10,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:10,083 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 524 transitions. [2019-12-07 17:58:10,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-07 17:58:10,083 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:10,084 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:10,084 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:10,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:10,084 INFO L82 PathProgramCache]: Analyzing trace with hash 317587356, now seen corresponding path program 1 times [2019-12-07 17:58:10,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:10,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354901060] [2019-12-07 17:58:10,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:58:10,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354901060] [2019-12-07 17:58:10,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:10,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:10,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993117612] [2019-12-07 17:58:10,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:10,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:10,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:10,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:10,129 INFO L87 Difference]: Start difference. First operand 347 states and 524 transitions. Second operand 4 states. [2019-12-07 17:58:10,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:10,357 INFO L93 Difference]: Finished difference Result 690 states and 1046 transitions. [2019-12-07 17:58:10,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:10,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-12-07 17:58:10,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:10,359 INFO L225 Difference]: With dead ends: 690 [2019-12-07 17:58:10,359 INFO L226 Difference]: Without dead ends: 362 [2019-12-07 17:58:10,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:10,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-12-07 17:58:10,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 350. [2019-12-07 17:58:10,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-12-07 17:58:10,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 527 transitions. [2019-12-07 17:58:10,366 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 527 transitions. Word has length 123 [2019-12-07 17:58:10,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:10,366 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 527 transitions. [2019-12-07 17:58:10,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:10,366 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 527 transitions. [2019-12-07 17:58:10,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-07 17:58:10,367 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:10,367 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:10,367 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:10,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:10,367 INFO L82 PathProgramCache]: Analyzing trace with hash 870150571, now seen corresponding path program 1 times [2019-12-07 17:58:10,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:10,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968157734] [2019-12-07 17:58:10,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:10,402 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 17:58:10,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968157734] [2019-12-07 17:58:10,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:10,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:10,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935116481] [2019-12-07 17:58:10,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:10,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:10,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:10,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:10,403 INFO L87 Difference]: Start difference. First operand 350 states and 527 transitions. Second operand 4 states. [2019-12-07 17:58:10,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:10,607 INFO L93 Difference]: Finished difference Result 697 states and 1053 transitions. [2019-12-07 17:58:10,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:10,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-12-07 17:58:10,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:10,609 INFO L225 Difference]: With dead ends: 697 [2019-12-07 17:58:10,609 INFO L226 Difference]: Without dead ends: 366 [2019-12-07 17:58:10,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:10,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-12-07 17:58:10,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 350. [2019-12-07 17:58:10,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-12-07 17:58:10,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 526 transitions. [2019-12-07 17:58:10,616 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 526 transitions. Word has length 130 [2019-12-07 17:58:10,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:10,616 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 526 transitions. [2019-12-07 17:58:10,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 526 transitions. [2019-12-07 17:58:10,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-07 17:58:10,617 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:10,617 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:10,617 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:10,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:10,617 INFO L82 PathProgramCache]: Analyzing trace with hash 445590493, now seen corresponding path program 1 times [2019-12-07 17:58:10,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:10,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205056127] [2019-12-07 17:58:10,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 17:58:10,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205056127] [2019-12-07 17:58:10,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:10,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:10,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053379440] [2019-12-07 17:58:10,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:10,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:10,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:10,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:10,659 INFO L87 Difference]: Start difference. First operand 350 states and 526 transitions. Second operand 4 states. [2019-12-07 17:58:10,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:10,923 INFO L93 Difference]: Finished difference Result 743 states and 1126 transitions. [2019-12-07 17:58:10,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:10,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-12-07 17:58:10,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:10,925 INFO L225 Difference]: With dead ends: 743 [2019-12-07 17:58:10,925 INFO L226 Difference]: Without dead ends: 412 [2019-12-07 17:58:10,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:10,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-12-07 17:58:10,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 378. [2019-12-07 17:58:10,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-12-07 17:58:10,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 575 transitions. [2019-12-07 17:58:10,932 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 575 transitions. Word has length 130 [2019-12-07 17:58:10,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:10,932 INFO L462 AbstractCegarLoop]: Abstraction has 378 states and 575 transitions. [2019-12-07 17:58:10,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:10,932 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 575 transitions. [2019-12-07 17:58:10,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-12-07 17:58:10,933 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:10,933 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:10,933 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:10,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:10,933 INFO L82 PathProgramCache]: Analyzing trace with hash 325472144, now seen corresponding path program 1 times [2019-12-07 17:58:10,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:10,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217984591] [2019-12-07 17:58:10,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:10,969 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 17:58:10,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217984591] [2019-12-07 17:58:10,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:10,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:10,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702641764] [2019-12-07 17:58:10,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:10,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:10,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:10,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:10,970 INFO L87 Difference]: Start difference. First operand 378 states and 575 transitions. Second operand 4 states. [2019-12-07 17:58:11,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:11,164 INFO L93 Difference]: Finished difference Result 751 states and 1147 transitions. [2019-12-07 17:58:11,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:11,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-12-07 17:58:11,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:11,166 INFO L225 Difference]: With dead ends: 751 [2019-12-07 17:58:11,166 INFO L226 Difference]: Without dead ends: 392 [2019-12-07 17:58:11,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:11,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-12-07 17:58:11,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 378. [2019-12-07 17:58:11,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-12-07 17:58:11,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 574 transitions. [2019-12-07 17:58:11,173 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 574 transitions. Word has length 131 [2019-12-07 17:58:11,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:11,173 INFO L462 AbstractCegarLoop]: Abstraction has 378 states and 574 transitions. [2019-12-07 17:58:11,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:11,174 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 574 transitions. [2019-12-07 17:58:11,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-12-07 17:58:11,174 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:11,174 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:11,174 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:11,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:11,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1414750288, now seen corresponding path program 1 times [2019-12-07 17:58:11,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:11,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304341857] [2019-12-07 17:58:11,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:58:11,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304341857] [2019-12-07 17:58:11,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:11,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:11,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043762139] [2019-12-07 17:58:11,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:11,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:11,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:11,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:11,210 INFO L87 Difference]: Start difference. First operand 378 states and 574 transitions. Second operand 4 states. [2019-12-07 17:58:11,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:11,532 INFO L93 Difference]: Finished difference Result 833 states and 1273 transitions. [2019-12-07 17:58:11,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:11,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-12-07 17:58:11,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:11,535 INFO L225 Difference]: With dead ends: 833 [2019-12-07 17:58:11,535 INFO L226 Difference]: Without dead ends: 474 [2019-12-07 17:58:11,536 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:11,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-12-07 17:58:11,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 390. [2019-12-07 17:58:11,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-12-07 17:58:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 591 transitions. [2019-12-07 17:58:11,545 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 591 transitions. Word has length 131 [2019-12-07 17:58:11,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:11,546 INFO L462 AbstractCegarLoop]: Abstraction has 390 states and 591 transitions. [2019-12-07 17:58:11,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:11,546 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 591 transitions. [2019-12-07 17:58:11,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-07 17:58:11,547 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:11,547 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:11,547 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:11,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:11,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1643757001, now seen corresponding path program 1 times [2019-12-07 17:58:11,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:11,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437481660] [2019-12-07 17:58:11,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:58:11,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437481660] [2019-12-07 17:58:11,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:11,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:11,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980801377] [2019-12-07 17:58:11,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:11,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:11,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:11,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:11,598 INFO L87 Difference]: Start difference. First operand 390 states and 591 transitions. Second operand 4 states. [2019-12-07 17:58:11,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:11,892 INFO L93 Difference]: Finished difference Result 845 states and 1289 transitions. [2019-12-07 17:58:11,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:11,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-12-07 17:58:11,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:11,894 INFO L225 Difference]: With dead ends: 845 [2019-12-07 17:58:11,894 INFO L226 Difference]: Without dead ends: 474 [2019-12-07 17:58:11,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:11,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-12-07 17:58:11,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 391. [2019-12-07 17:58:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-12-07 17:58:11,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 592 transitions. [2019-12-07 17:58:11,902 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 592 transitions. Word has length 132 [2019-12-07 17:58:11,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:11,902 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 592 transitions. [2019-12-07 17:58:11,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:11,902 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 592 transitions. [2019-12-07 17:58:11,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 17:58:11,903 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:11,903 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:11,903 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:11,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:11,903 INFO L82 PathProgramCache]: Analyzing trace with hash 704995659, now seen corresponding path program 1 times [2019-12-07 17:58:11,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:11,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578097115] [2019-12-07 17:58:11,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:11,938 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:58:11,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578097115] [2019-12-07 17:58:11,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:11,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:11,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388513864] [2019-12-07 17:58:11,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:11,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:11,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:11,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:11,939 INFO L87 Difference]: Start difference. First operand 391 states and 592 transitions. Second operand 4 states. [2019-12-07 17:58:12,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:12,230 INFO L93 Difference]: Finished difference Result 846 states and 1289 transitions. [2019-12-07 17:58:12,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:12,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-12-07 17:58:12,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:12,232 INFO L225 Difference]: With dead ends: 846 [2019-12-07 17:58:12,232 INFO L226 Difference]: Without dead ends: 474 [2019-12-07 17:58:12,232 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:12,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-12-07 17:58:12,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 392. [2019-12-07 17:58:12,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-12-07 17:58:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 593 transitions. [2019-12-07 17:58:12,240 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 593 transitions. Word has length 133 [2019-12-07 17:58:12,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:12,240 INFO L462 AbstractCegarLoop]: Abstraction has 392 states and 593 transitions. [2019-12-07 17:58:12,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:12,240 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 593 transitions. [2019-12-07 17:58:12,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 17:58:12,241 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:12,241 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:12,241 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:12,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:12,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1119885102, now seen corresponding path program 1 times [2019-12-07 17:58:12,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:12,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424762491] [2019-12-07 17:58:12,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:12,278 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:58:12,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424762491] [2019-12-07 17:58:12,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:12,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:12,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451031220] [2019-12-07 17:58:12,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:12,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:12,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:12,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:12,279 INFO L87 Difference]: Start difference. First operand 392 states and 593 transitions. Second operand 4 states. [2019-12-07 17:58:12,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:12,554 INFO L93 Difference]: Finished difference Result 837 states and 1277 transitions. [2019-12-07 17:58:12,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:12,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-12-07 17:58:12,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:12,556 INFO L225 Difference]: With dead ends: 837 [2019-12-07 17:58:12,556 INFO L226 Difference]: Without dead ends: 464 [2019-12-07 17:58:12,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:12,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-12-07 17:58:12,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 393. [2019-12-07 17:58:12,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-12-07 17:58:12,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 594 transitions. [2019-12-07 17:58:12,564 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 594 transitions. Word has length 134 [2019-12-07 17:58:12,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:12,564 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 594 transitions. [2019-12-07 17:58:12,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:12,565 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 594 transitions. [2019-12-07 17:58:12,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-12-07 17:58:12,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:12,565 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:12,565 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:12,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:12,566 INFO L82 PathProgramCache]: Analyzing trace with hash -595235943, now seen corresponding path program 1 times [2019-12-07 17:58:12,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:12,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352047618] [2019-12-07 17:58:12,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:12,607 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:58:12,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352047618] [2019-12-07 17:58:12,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:12,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:12,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833202273] [2019-12-07 17:58:12,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:12,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:12,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:12,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:12,608 INFO L87 Difference]: Start difference. First operand 393 states and 594 transitions. Second operand 4 states. [2019-12-07 17:58:12,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:12,941 INFO L93 Difference]: Finished difference Result 848 states and 1289 transitions. [2019-12-07 17:58:12,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:12,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-12-07 17:58:12,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:12,943 INFO L225 Difference]: With dead ends: 848 [2019-12-07 17:58:12,943 INFO L226 Difference]: Without dead ends: 474 [2019-12-07 17:58:12,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:12,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-12-07 17:58:12,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 393. [2019-12-07 17:58:12,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-12-07 17:58:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 593 transitions. [2019-12-07 17:58:12,951 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 593 transitions. Word has length 136 [2019-12-07 17:58:12,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:12,951 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 593 transitions. [2019-12-07 17:58:12,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:12,951 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 593 transitions. [2019-12-07 17:58:12,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-12-07 17:58:12,952 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:12,952 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:12,952 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:12,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:12,952 INFO L82 PathProgramCache]: Analyzing trace with hash 471179278, now seen corresponding path program 1 times [2019-12-07 17:58:12,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:12,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096970178] [2019-12-07 17:58:12,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:58:12,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096970178] [2019-12-07 17:58:12,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:12,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:12,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931198516] [2019-12-07 17:58:12,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:12,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:12,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:12,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:12,987 INFO L87 Difference]: Start difference. First operand 393 states and 593 transitions. Second operand 4 states. [2019-12-07 17:58:13,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:13,292 INFO L93 Difference]: Finished difference Result 848 states and 1287 transitions. [2019-12-07 17:58:13,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:13,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-12-07 17:58:13,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:13,294 INFO L225 Difference]: With dead ends: 848 [2019-12-07 17:58:13,294 INFO L226 Difference]: Without dead ends: 474 [2019-12-07 17:58:13,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:13,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-12-07 17:58:13,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 393. [2019-12-07 17:58:13,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-12-07 17:58:13,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 592 transitions. [2019-12-07 17:58:13,302 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 592 transitions. Word has length 137 [2019-12-07 17:58:13,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:13,302 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 592 transitions. [2019-12-07 17:58:13,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:13,303 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 592 transitions. [2019-12-07 17:58:13,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-12-07 17:58:13,303 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:13,303 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:13,303 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:13,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:13,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1843510868, now seen corresponding path program 1 times [2019-12-07 17:58:13,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:13,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765723278] [2019-12-07 17:58:13,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:13,338 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:58:13,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765723278] [2019-12-07 17:58:13,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:13,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:13,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169032415] [2019-12-07 17:58:13,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:13,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:13,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:13,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:13,339 INFO L87 Difference]: Start difference. First operand 393 states and 592 transitions. Second operand 4 states. [2019-12-07 17:58:13,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:13,677 INFO L93 Difference]: Finished difference Result 848 states and 1285 transitions. [2019-12-07 17:58:13,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:13,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-12-07 17:58:13,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:13,679 INFO L225 Difference]: With dead ends: 848 [2019-12-07 17:58:13,679 INFO L226 Difference]: Without dead ends: 474 [2019-12-07 17:58:13,680 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:13,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-12-07 17:58:13,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 393. [2019-12-07 17:58:13,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-12-07 17:58:13,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 591 transitions. [2019-12-07 17:58:13,688 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 591 transitions. Word has length 138 [2019-12-07 17:58:13,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:13,689 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 591 transitions. [2019-12-07 17:58:13,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:13,689 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 591 transitions. [2019-12-07 17:58:13,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-12-07 17:58:13,689 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:13,689 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:13,690 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:13,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:13,690 INFO L82 PathProgramCache]: Analyzing trace with hash -185651991, now seen corresponding path program 1 times [2019-12-07 17:58:13,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:13,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879577343] [2019-12-07 17:58:13,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:13,732 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:58:13,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879577343] [2019-12-07 17:58:13,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:13,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:13,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954866260] [2019-12-07 17:58:13,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:13,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:13,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:13,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:13,733 INFO L87 Difference]: Start difference. First operand 393 states and 591 transitions. Second operand 4 states. [2019-12-07 17:58:14,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:14,031 INFO L93 Difference]: Finished difference Result 838 states and 1271 transitions. [2019-12-07 17:58:14,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:14,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-12-07 17:58:14,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:14,033 INFO L225 Difference]: With dead ends: 838 [2019-12-07 17:58:14,033 INFO L226 Difference]: Without dead ends: 464 [2019-12-07 17:58:14,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:14,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-12-07 17:58:14,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 378. [2019-12-07 17:58:14,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-12-07 17:58:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 570 transitions. [2019-12-07 17:58:14,042 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 570 transitions. Word has length 139 [2019-12-07 17:58:14,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:14,043 INFO L462 AbstractCegarLoop]: Abstraction has 378 states and 570 transitions. [2019-12-07 17:58:14,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:14,043 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 570 transitions. [2019-12-07 17:58:14,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-12-07 17:58:14,043 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:14,043 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:14,043 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:14,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:14,044 INFO L82 PathProgramCache]: Analyzing trace with hash -212711369, now seen corresponding path program 1 times [2019-12-07 17:58:14,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:14,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033242812] [2019-12-07 17:58:14,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:14,082 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:58:14,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033242812] [2019-12-07 17:58:14,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:14,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:14,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813185081] [2019-12-07 17:58:14,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:14,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:14,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:14,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:14,083 INFO L87 Difference]: Start difference. First operand 378 states and 570 transitions. Second operand 4 states. [2019-12-07 17:58:14,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:14,349 INFO L93 Difference]: Finished difference Result 823 states and 1249 transitions. [2019-12-07 17:58:14,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:14,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-12-07 17:58:14,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:14,351 INFO L225 Difference]: With dead ends: 823 [2019-12-07 17:58:14,351 INFO L226 Difference]: Without dead ends: 464 [2019-12-07 17:58:14,352 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:14,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-12-07 17:58:14,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 406. [2019-12-07 17:58:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-12-07 17:58:14,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 615 transitions. [2019-12-07 17:58:14,365 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 615 transitions. Word has length 141 [2019-12-07 17:58:14,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:14,365 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 615 transitions. [2019-12-07 17:58:14,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:14,365 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 615 transitions. [2019-12-07 17:58:14,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-12-07 17:58:14,366 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:14,366 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:14,366 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:14,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:14,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1817448354, now seen corresponding path program 1 times [2019-12-07 17:58:14,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:14,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342847232] [2019-12-07 17:58:14,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:14,405 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:58:14,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342847232] [2019-12-07 17:58:14,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:14,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:14,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80676562] [2019-12-07 17:58:14,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:14,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:14,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:14,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:14,406 INFO L87 Difference]: Start difference. First operand 406 states and 615 transitions. Second operand 4 states. [2019-12-07 17:58:14,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:14,723 INFO L93 Difference]: Finished difference Result 843 states and 1280 transitions. [2019-12-07 17:58:14,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:14,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-12-07 17:58:14,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:14,730 INFO L225 Difference]: With dead ends: 843 [2019-12-07 17:58:14,730 INFO L226 Difference]: Without dead ends: 456 [2019-12-07 17:58:14,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:14,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-12-07 17:58:14,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 407. [2019-12-07 17:58:14,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 17:58:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 616 transitions. [2019-12-07 17:58:14,757 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 616 transitions. Word has length 142 [2019-12-07 17:58:14,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:14,757 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 616 transitions. [2019-12-07 17:58:14,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:14,757 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 616 transitions. [2019-12-07 17:58:14,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-12-07 17:58:14,758 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:14,759 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:14,759 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:14,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:14,759 INFO L82 PathProgramCache]: Analyzing trace with hash -29899615, now seen corresponding path program 1 times [2019-12-07 17:58:14,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:14,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160148123] [2019-12-07 17:58:14,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:14,799 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 17:58:14,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160148123] [2019-12-07 17:58:14,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:14,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:14,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869641270] [2019-12-07 17:58:14,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:14,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:14,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:14,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:14,800 INFO L87 Difference]: Start difference. First operand 407 states and 616 transitions. Second operand 4 states. [2019-12-07 17:58:15,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:15,054 INFO L93 Difference]: Finished difference Result 844 states and 1280 transitions. [2019-12-07 17:58:15,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:15,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-12-07 17:58:15,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:15,056 INFO L225 Difference]: With dead ends: 844 [2019-12-07 17:58:15,056 INFO L226 Difference]: Without dead ends: 456 [2019-12-07 17:58:15,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:15,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-12-07 17:58:15,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 407. [2019-12-07 17:58:15,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 17:58:15,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 615 transitions. [2019-12-07 17:58:15,066 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 615 transitions. Word has length 144 [2019-12-07 17:58:15,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:15,066 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 615 transitions. [2019-12-07 17:58:15,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:15,066 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 615 transitions. [2019-12-07 17:58:15,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-12-07 17:58:15,067 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:15,067 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:15,067 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:15,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:15,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1806279846, now seen corresponding path program 1 times [2019-12-07 17:58:15,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:15,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414551378] [2019-12-07 17:58:15,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:15,104 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 17:58:15,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414551378] [2019-12-07 17:58:15,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:15,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:15,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275561701] [2019-12-07 17:58:15,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:15,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:15,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:15,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:15,105 INFO L87 Difference]: Start difference. First operand 407 states and 615 transitions. Second operand 4 states. [2019-12-07 17:58:15,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:15,353 INFO L93 Difference]: Finished difference Result 842 states and 1276 transitions. [2019-12-07 17:58:15,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:15,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-12-07 17:58:15,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:15,355 INFO L225 Difference]: With dead ends: 842 [2019-12-07 17:58:15,355 INFO L226 Difference]: Without dead ends: 454 [2019-12-07 17:58:15,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:15,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-12-07 17:58:15,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 407. [2019-12-07 17:58:15,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 17:58:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 614 transitions. [2019-12-07 17:58:15,365 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 614 transitions. Word has length 145 [2019-12-07 17:58:15,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:15,365 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 614 transitions. [2019-12-07 17:58:15,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:15,365 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 614 transitions. [2019-12-07 17:58:15,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-12-07 17:58:15,365 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:15,366 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:15,366 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:15,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:15,366 INFO L82 PathProgramCache]: Analyzing trace with hash -108566865, now seen corresponding path program 1 times [2019-12-07 17:58:15,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:15,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156362909] [2019-12-07 17:58:15,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:15,405 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:58:15,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156362909] [2019-12-07 17:58:15,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:15,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:15,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979631941] [2019-12-07 17:58:15,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:15,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:15,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:15,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:15,406 INFO L87 Difference]: Start difference. First operand 407 states and 614 transitions. Second operand 4 states. [2019-12-07 17:58:15,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:15,659 INFO L93 Difference]: Finished difference Result 839 states and 1270 transitions. [2019-12-07 17:58:15,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:15,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-12-07 17:58:15,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:15,661 INFO L225 Difference]: With dead ends: 839 [2019-12-07 17:58:15,661 INFO L226 Difference]: Without dead ends: 451 [2019-12-07 17:58:15,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:15,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-12-07 17:58:15,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 410. [2019-12-07 17:58:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-12-07 17:58:15,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 619 transitions. [2019-12-07 17:58:15,671 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 619 transitions. Word has length 145 [2019-12-07 17:58:15,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:15,671 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 619 transitions. [2019-12-07 17:58:15,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:15,671 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 619 transitions. [2019-12-07 17:58:15,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-12-07 17:58:15,671 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:15,672 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:15,672 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:15,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:15,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1574770376, now seen corresponding path program 1 times [2019-12-07 17:58:15,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:15,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071012601] [2019-12-07 17:58:15,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 17:58:15,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071012601] [2019-12-07 17:58:15,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:15,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:15,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394599761] [2019-12-07 17:58:15,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:15,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:15,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:15,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:15,722 INFO L87 Difference]: Start difference. First operand 410 states and 619 transitions. Second operand 4 states. [2019-12-07 17:58:16,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:16,000 INFO L93 Difference]: Finished difference Result 835 states and 1262 transitions. [2019-12-07 17:58:16,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:16,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-12-07 17:58:16,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:16,002 INFO L225 Difference]: With dead ends: 835 [2019-12-07 17:58:16,003 INFO L226 Difference]: Without dead ends: 444 [2019-12-07 17:58:16,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:16,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-12-07 17:58:16,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 410. [2019-12-07 17:58:16,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-12-07 17:58:16,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 618 transitions. [2019-12-07 17:58:16,013 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 618 transitions. Word has length 145 [2019-12-07 17:58:16,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:16,013 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 618 transitions. [2019-12-07 17:58:16,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:16,013 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 618 transitions. [2019-12-07 17:58:16,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-07 17:58:16,013 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:16,014 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:16,014 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:16,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:16,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1377203136, now seen corresponding path program 1 times [2019-12-07 17:58:16,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:16,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782040167] [2019-12-07 17:58:16,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:16,055 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:58:16,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782040167] [2019-12-07 17:58:16,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:16,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:16,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976939902] [2019-12-07 17:58:16,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:16,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:16,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:16,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:16,056 INFO L87 Difference]: Start difference. First operand 410 states and 618 transitions. Second operand 4 states. [2019-12-07 17:58:16,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:16,336 INFO L93 Difference]: Finished difference Result 855 states and 1291 transitions. [2019-12-07 17:58:16,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:16,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-12-07 17:58:16,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:16,338 INFO L225 Difference]: With dead ends: 855 [2019-12-07 17:58:16,338 INFO L226 Difference]: Without dead ends: 464 [2019-12-07 17:58:16,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:16,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-12-07 17:58:16,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 410. [2019-12-07 17:58:16,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-12-07 17:58:16,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 617 transitions. [2019-12-07 17:58:16,349 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 617 transitions. Word has length 146 [2019-12-07 17:58:16,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:16,349 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 617 transitions. [2019-12-07 17:58:16,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:16,349 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 617 transitions. [2019-12-07 17:58:16,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-07 17:58:16,350 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:16,350 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:16,350 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:16,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:16,350 INFO L82 PathProgramCache]: Analyzing trace with hash 170382927, now seen corresponding path program 1 times [2019-12-07 17:58:16,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:16,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894862196] [2019-12-07 17:58:16,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:16,387 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 17:58:16,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894862196] [2019-12-07 17:58:16,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:16,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:16,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14936753] [2019-12-07 17:58:16,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:16,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:16,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:16,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:16,388 INFO L87 Difference]: Start difference. First operand 410 states and 617 transitions. Second operand 4 states. [2019-12-07 17:58:16,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:16,664 INFO L93 Difference]: Finished difference Result 835 states and 1258 transitions. [2019-12-07 17:58:16,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:16,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-12-07 17:58:16,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:16,666 INFO L225 Difference]: With dead ends: 835 [2019-12-07 17:58:16,666 INFO L226 Difference]: Without dead ends: 444 [2019-12-07 17:58:16,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:16,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-12-07 17:58:16,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 410. [2019-12-07 17:58:16,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-12-07 17:58:16,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 616 transitions. [2019-12-07 17:58:16,676 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 616 transitions. Word has length 146 [2019-12-07 17:58:16,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:16,676 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 616 transitions. [2019-12-07 17:58:16,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:16,677 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 616 transitions. [2019-12-07 17:58:16,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-07 17:58:16,677 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:16,677 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:16,677 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:16,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:16,678 INFO L82 PathProgramCache]: Analyzing trace with hash 738012533, now seen corresponding path program 1 times [2019-12-07 17:58:16,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:16,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880578032] [2019-12-07 17:58:16,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:16,718 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:58:16,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880578032] [2019-12-07 17:58:16,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:16,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:16,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126465044] [2019-12-07 17:58:16,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:16,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:16,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:16,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:16,719 INFO L87 Difference]: Start difference. First operand 410 states and 616 transitions. Second operand 4 states. [2019-12-07 17:58:16,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:16,998 INFO L93 Difference]: Finished difference Result 847 states and 1274 transitions. [2019-12-07 17:58:16,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:16,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-12-07 17:58:16,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:16,999 INFO L225 Difference]: With dead ends: 847 [2019-12-07 17:58:17,000 INFO L226 Difference]: Without dead ends: 456 [2019-12-07 17:58:17,000 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:17,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-12-07 17:58:17,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 410. [2019-12-07 17:58:17,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-12-07 17:58:17,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 615 transitions. [2019-12-07 17:58:17,010 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 615 transitions. Word has length 147 [2019-12-07 17:58:17,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:17,011 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 615 transitions. [2019-12-07 17:58:17,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:17,011 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2019-12-07 17:58:17,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-07 17:58:17,011 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:17,011 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:17,012 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:17,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:17,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1344308336, now seen corresponding path program 1 times [2019-12-07 17:58:17,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:17,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098570958] [2019-12-07 17:58:17,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:17,052 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:58:17,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098570958] [2019-12-07 17:58:17,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:17,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:17,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482104406] [2019-12-07 17:58:17,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:17,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:17,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:17,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:17,053 INFO L87 Difference]: Start difference. First operand 410 states and 615 transitions. Second operand 4 states. [2019-12-07 17:58:17,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:17,301 INFO L93 Difference]: Finished difference Result 842 states and 1266 transitions. [2019-12-07 17:58:17,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:17,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-12-07 17:58:17,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:17,302 INFO L225 Difference]: With dead ends: 842 [2019-12-07 17:58:17,302 INFO L226 Difference]: Without dead ends: 451 [2019-12-07 17:58:17,303 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:17,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-12-07 17:58:17,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 411. [2019-12-07 17:58:17,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-12-07 17:58:17,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 616 transitions. [2019-12-07 17:58:17,313 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 616 transitions. Word has length 147 [2019-12-07 17:58:17,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:17,313 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 616 transitions. [2019-12-07 17:58:17,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:17,313 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 616 transitions. [2019-12-07 17:58:17,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-07 17:58:17,314 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:17,314 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:17,314 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:17,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:17,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1108758579, now seen corresponding path program 1 times [2019-12-07 17:58:17,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:17,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662633771] [2019-12-07 17:58:17,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:17,352 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 17:58:17,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662633771] [2019-12-07 17:58:17,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:17,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:17,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150763165] [2019-12-07 17:58:17,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:17,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:17,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:17,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:17,353 INFO L87 Difference]: Start difference. First operand 411 states and 616 transitions. Second operand 4 states. [2019-12-07 17:58:17,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:17,637 INFO L93 Difference]: Finished difference Result 837 states and 1256 transitions. [2019-12-07 17:58:17,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:17,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-12-07 17:58:17,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:17,638 INFO L225 Difference]: With dead ends: 837 [2019-12-07 17:58:17,638 INFO L226 Difference]: Without dead ends: 445 [2019-12-07 17:58:17,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:17,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-12-07 17:58:17,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 411. [2019-12-07 17:58:17,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-12-07 17:58:17,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 615 transitions. [2019-12-07 17:58:17,658 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 615 transitions. Word has length 147 [2019-12-07 17:58:17,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:17,658 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 615 transitions. [2019-12-07 17:58:17,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:17,658 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 615 transitions. [2019-12-07 17:58:17,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 17:58:17,659 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:17,659 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:17,659 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:17,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:17,660 INFO L82 PathProgramCache]: Analyzing trace with hash -506259172, now seen corresponding path program 1 times [2019-12-07 17:58:17,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:17,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607730626] [2019-12-07 17:58:17,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:17,700 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:58:17,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607730626] [2019-12-07 17:58:17,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:17,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:17,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983905973] [2019-12-07 17:58:17,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:17,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:17,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:17,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:17,701 INFO L87 Difference]: Start difference. First operand 411 states and 615 transitions. Second operand 4 states. [2019-12-07 17:58:17,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:17,953 INFO L93 Difference]: Finished difference Result 839 states and 1259 transitions. [2019-12-07 17:58:17,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:17,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-12-07 17:58:17,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:17,954 INFO L225 Difference]: With dead ends: 839 [2019-12-07 17:58:17,954 INFO L226 Difference]: Without dead ends: 447 [2019-12-07 17:58:17,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:17,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-12-07 17:58:17,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 412. [2019-12-07 17:58:17,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-12-07 17:58:17,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 616 transitions. [2019-12-07 17:58:17,965 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 616 transitions. Word has length 148 [2019-12-07 17:58:17,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:17,966 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 616 transitions. [2019-12-07 17:58:17,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:17,966 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 616 transitions. [2019-12-07 17:58:17,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 17:58:17,966 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:17,966 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:17,967 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:17,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:17,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1511302130, now seen corresponding path program 1 times [2019-12-07 17:58:17,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:17,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682165521] [2019-12-07 17:58:17,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:18,008 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:58:18,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682165521] [2019-12-07 17:58:18,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:18,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:18,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114017672] [2019-12-07 17:58:18,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:18,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:18,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:18,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:18,009 INFO L87 Difference]: Start difference. First operand 412 states and 616 transitions. Second operand 4 states. [2019-12-07 17:58:18,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:18,275 INFO L93 Difference]: Finished difference Result 840 states and 1259 transitions. [2019-12-07 17:58:18,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:18,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-12-07 17:58:18,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:18,276 INFO L225 Difference]: With dead ends: 840 [2019-12-07 17:58:18,276 INFO L226 Difference]: Without dead ends: 447 [2019-12-07 17:58:18,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:18,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-12-07 17:58:18,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 413. [2019-12-07 17:58:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-07 17:58:18,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 617 transitions. [2019-12-07 17:58:18,288 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 617 transitions. Word has length 148 [2019-12-07 17:58:18,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:18,288 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 617 transitions. [2019-12-07 17:58:18,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:18,288 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 617 transitions. [2019-12-07 17:58:18,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 17:58:18,289 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:18,290 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:18,290 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:18,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:18,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1488136470, now seen corresponding path program 1 times [2019-12-07 17:58:18,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:18,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630289479] [2019-12-07 17:58:18,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:18,329 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 17:58:18,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630289479] [2019-12-07 17:58:18,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:18,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:18,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131195234] [2019-12-07 17:58:18,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:18,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:18,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:18,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:18,330 INFO L87 Difference]: Start difference. First operand 413 states and 617 transitions. Second operand 4 states. [2019-12-07 17:58:18,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:18,582 INFO L93 Difference]: Finished difference Result 831 states and 1246 transitions. [2019-12-07 17:58:18,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:18,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-12-07 17:58:18,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:18,583 INFO L225 Difference]: With dead ends: 831 [2019-12-07 17:58:18,583 INFO L226 Difference]: Without dead ends: 437 [2019-12-07 17:58:18,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:18,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-12-07 17:58:18,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 413. [2019-12-07 17:58:18,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-07 17:58:18,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 616 transitions. [2019-12-07 17:58:18,596 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 616 transitions. Word has length 148 [2019-12-07 17:58:18,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:18,596 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 616 transitions. [2019-12-07 17:58:18,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 616 transitions. [2019-12-07 17:58:18,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-07 17:58:18,597 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:18,597 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:18,597 INFO L410 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:18,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:18,597 INFO L82 PathProgramCache]: Analyzing trace with hash -953280520, now seen corresponding path program 1 times [2019-12-07 17:58:18,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:18,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866303539] [2019-12-07 17:58:18,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:18,635 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 17:58:18,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866303539] [2019-12-07 17:58:18,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:18,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:18,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963123134] [2019-12-07 17:58:18,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:18,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:18,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:18,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:18,636 INFO L87 Difference]: Start difference. First operand 413 states and 616 transitions. Second operand 4 states. [2019-12-07 17:58:18,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:18,908 INFO L93 Difference]: Finished difference Result 850 states and 1268 transitions. [2019-12-07 17:58:18,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:18,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-12-07 17:58:18,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:18,909 INFO L225 Difference]: With dead ends: 850 [2019-12-07 17:58:18,909 INFO L226 Difference]: Without dead ends: 456 [2019-12-07 17:58:18,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:18,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-12-07 17:58:18,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 413. [2019-12-07 17:58:18,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-07 17:58:18,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 615 transitions. [2019-12-07 17:58:18,920 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 615 transitions. Word has length 149 [2019-12-07 17:58:18,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:18,920 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 615 transitions. [2019-12-07 17:58:18,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:18,921 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 615 transitions. [2019-12-07 17:58:18,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-07 17:58:18,921 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:18,921 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:18,921 INFO L410 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:18,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:18,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1119754174, now seen corresponding path program 1 times [2019-12-07 17:58:18,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:18,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003772406] [2019-12-07 17:58:18,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:58:18,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003772406] [2019-12-07 17:58:18,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:18,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:18,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957002333] [2019-12-07 17:58:18,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:18,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:18,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:18,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:18,964 INFO L87 Difference]: Start difference. First operand 413 states and 615 transitions. Second operand 4 states. [2019-12-07 17:58:19,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:19,237 INFO L93 Difference]: Finished difference Result 839 states and 1253 transitions. [2019-12-07 17:58:19,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:19,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-12-07 17:58:19,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:19,238 INFO L225 Difference]: With dead ends: 839 [2019-12-07 17:58:19,238 INFO L226 Difference]: Without dead ends: 445 [2019-12-07 17:58:19,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:19,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-12-07 17:58:19,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 414. [2019-12-07 17:58:19,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-12-07 17:58:19,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 616 transitions. [2019-12-07 17:58:19,250 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 616 transitions. Word has length 149 [2019-12-07 17:58:19,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:19,250 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 616 transitions. [2019-12-07 17:58:19,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:19,250 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 616 transitions. [2019-12-07 17:58:19,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-07 17:58:19,251 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:19,251 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:19,251 INFO L410 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:19,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:19,251 INFO L82 PathProgramCache]: Analyzing trace with hash -366316829, now seen corresponding path program 1 times [2019-12-07 17:58:19,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:19,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14560948] [2019-12-07 17:58:19,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:19,289 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 17:58:19,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14560948] [2019-12-07 17:58:19,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:19,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:19,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532964187] [2019-12-07 17:58:19,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:19,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:19,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:19,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:19,290 INFO L87 Difference]: Start difference. First operand 414 states and 616 transitions. Second operand 4 states. [2019-12-07 17:58:19,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:19,575 INFO L93 Difference]: Finished difference Result 849 states and 1264 transitions. [2019-12-07 17:58:19,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:19,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-12-07 17:58:19,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:19,576 INFO L225 Difference]: With dead ends: 849 [2019-12-07 17:58:19,576 INFO L226 Difference]: Without dead ends: 454 [2019-12-07 17:58:19,577 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:19,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-12-07 17:58:19,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 414. [2019-12-07 17:58:19,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-12-07 17:58:19,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 615 transitions. [2019-12-07 17:58:19,592 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 615 transitions. Word has length 150 [2019-12-07 17:58:19,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:19,592 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 615 transitions. [2019-12-07 17:58:19,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:19,592 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 615 transitions. [2019-12-07 17:58:19,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-07 17:58:19,593 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:19,593 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:19,593 INFO L410 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:19,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:19,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1331396152, now seen corresponding path program 1 times [2019-12-07 17:58:19,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:19,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654923800] [2019-12-07 17:58:19,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:19,633 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:58:19,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654923800] [2019-12-07 17:58:19,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:19,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:19,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236236429] [2019-12-07 17:58:19,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:19,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:19,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:19,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:19,634 INFO L87 Difference]: Start difference. First operand 414 states and 615 transitions. Second operand 4 states. [2019-12-07 17:58:19,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:19,903 INFO L93 Difference]: Finished difference Result 846 states and 1258 transitions. [2019-12-07 17:58:19,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:19,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-12-07 17:58:19,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:19,905 INFO L225 Difference]: With dead ends: 846 [2019-12-07 17:58:19,905 INFO L226 Difference]: Without dead ends: 451 [2019-12-07 17:58:19,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:19,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-12-07 17:58:19,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 414. [2019-12-07 17:58:19,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-12-07 17:58:19,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 614 transitions. [2019-12-07 17:58:19,917 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 614 transitions. Word has length 150 [2019-12-07 17:58:19,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:19,917 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 614 transitions. [2019-12-07 17:58:19,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:19,917 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 614 transitions. [2019-12-07 17:58:19,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-07 17:58:19,918 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:19,918 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:19,918 INFO L410 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:19,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:19,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1822138889, now seen corresponding path program 1 times [2019-12-07 17:58:19,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:19,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402569185] [2019-12-07 17:58:19,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:19,961 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:58:19,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402569185] [2019-12-07 17:58:19,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:19,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:19,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581009590] [2019-12-07 17:58:19,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:19,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:19,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:19,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:19,962 INFO L87 Difference]: Start difference. First operand 414 states and 614 transitions. Second operand 4 states. [2019-12-07 17:58:20,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:20,217 INFO L93 Difference]: Finished difference Result 840 states and 1249 transitions. [2019-12-07 17:58:20,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:20,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-12-07 17:58:20,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:20,218 INFO L225 Difference]: With dead ends: 840 [2019-12-07 17:58:20,218 INFO L226 Difference]: Without dead ends: 445 [2019-12-07 17:58:20,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:20,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-12-07 17:58:20,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 415. [2019-12-07 17:58:20,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-12-07 17:58:20,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 615 transitions. [2019-12-07 17:58:20,230 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 615 transitions. Word has length 150 [2019-12-07 17:58:20,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:20,230 INFO L462 AbstractCegarLoop]: Abstraction has 415 states and 615 transitions. [2019-12-07 17:58:20,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:20,230 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 615 transitions. [2019-12-07 17:58:20,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-07 17:58:20,231 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:20,231 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:20,231 INFO L410 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:20,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:20,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2067168413, now seen corresponding path program 1 times [2019-12-07 17:58:20,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:20,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364818428] [2019-12-07 17:58:20,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:20,274 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:58:20,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364818428] [2019-12-07 17:58:20,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:20,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:20,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177274126] [2019-12-07 17:58:20,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:20,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:20,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:20,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:20,275 INFO L87 Difference]: Start difference. First operand 415 states and 615 transitions. Second operand 4 states. [2019-12-07 17:58:20,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:20,524 INFO L93 Difference]: Finished difference Result 839 states and 1247 transitions. [2019-12-07 17:58:20,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:20,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-12-07 17:58:20,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:20,524 INFO L225 Difference]: With dead ends: 839 [2019-12-07 17:58:20,524 INFO L226 Difference]: Without dead ends: 443 [2019-12-07 17:58:20,525 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:20,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-12-07 17:58:20,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 416. [2019-12-07 17:58:20,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-12-07 17:58:20,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 616 transitions. [2019-12-07 17:58:20,537 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 616 transitions. Word has length 151 [2019-12-07 17:58:20,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:20,537 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 616 transitions. [2019-12-07 17:58:20,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:20,537 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 616 transitions. [2019-12-07 17:58:20,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-12-07 17:58:20,538 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:20,538 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:20,538 INFO L410 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:20,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:20,538 INFO L82 PathProgramCache]: Analyzing trace with hash -2125668935, now seen corresponding path program 1 times [2019-12-07 17:58:20,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:20,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533586394] [2019-12-07 17:58:20,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:20,580 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:58:20,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533586394] [2019-12-07 17:58:20,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:20,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:20,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2598494] [2019-12-07 17:58:20,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:20,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:20,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:20,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:20,581 INFO L87 Difference]: Start difference. First operand 416 states and 616 transitions. Second operand 4 states. [2019-12-07 17:58:20,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:20,840 INFO L93 Difference]: Finished difference Result 848 states and 1256 transitions. [2019-12-07 17:58:20,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:20,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-12-07 17:58:20,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:20,841 INFO L225 Difference]: With dead ends: 848 [2019-12-07 17:58:20,841 INFO L226 Difference]: Without dead ends: 451 [2019-12-07 17:58:20,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:20,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-12-07 17:58:20,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 416. [2019-12-07 17:58:20,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-12-07 17:58:20,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 615 transitions. [2019-12-07 17:58:20,858 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 615 transitions. Word has length 152 [2019-12-07 17:58:20,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:20,858 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 615 transitions. [2019-12-07 17:58:20,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:20,858 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 615 transitions. [2019-12-07 17:58:20,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-12-07 17:58:20,859 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:20,859 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:20,859 INFO L410 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:20,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:20,859 INFO L82 PathProgramCache]: Analyzing trace with hash -701372173, now seen corresponding path program 1 times [2019-12-07 17:58:20,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:20,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172071430] [2019-12-07 17:58:20,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:20,903 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:58:20,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172071430] [2019-12-07 17:58:20,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:20,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:20,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239820528] [2019-12-07 17:58:20,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:20,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:20,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:20,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:20,904 INFO L87 Difference]: Start difference. First operand 416 states and 615 transitions. Second operand 4 states. [2019-12-07 17:58:21,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:21,167 INFO L93 Difference]: Finished difference Result 844 states and 1249 transitions. [2019-12-07 17:58:21,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:21,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-12-07 17:58:21,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:21,168 INFO L225 Difference]: With dead ends: 844 [2019-12-07 17:58:21,168 INFO L226 Difference]: Without dead ends: 447 [2019-12-07 17:58:21,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:21,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-12-07 17:58:21,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 416. [2019-12-07 17:58:21,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-12-07 17:58:21,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 614 transitions. [2019-12-07 17:58:21,181 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 614 transitions. Word has length 153 [2019-12-07 17:58:21,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:21,181 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 614 transitions. [2019-12-07 17:58:21,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:21,181 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 614 transitions. [2019-12-07 17:58:21,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-12-07 17:58:21,182 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:21,182 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:21,182 INFO L410 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:21,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:21,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1706415131, now seen corresponding path program 1 times [2019-12-07 17:58:21,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:21,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779336581] [2019-12-07 17:58:21,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:58:21,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779336581] [2019-12-07 17:58:21,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:21,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:21,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952663279] [2019-12-07 17:58:21,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:21,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:21,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:21,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:21,229 INFO L87 Difference]: Start difference. First operand 416 states and 614 transitions. Second operand 4 states. [2019-12-07 17:58:21,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:21,484 INFO L93 Difference]: Finished difference Result 844 states and 1247 transitions. [2019-12-07 17:58:21,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:21,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-12-07 17:58:21,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:21,485 INFO L225 Difference]: With dead ends: 844 [2019-12-07 17:58:21,485 INFO L226 Difference]: Without dead ends: 447 [2019-12-07 17:58:21,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:21,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-12-07 17:58:21,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 416. [2019-12-07 17:58:21,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-12-07 17:58:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 613 transitions. [2019-12-07 17:58:21,498 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 613 transitions. Word has length 153 [2019-12-07 17:58:21,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:21,498 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 613 transitions. [2019-12-07 17:58:21,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:21,498 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 613 transitions. [2019-12-07 17:58:21,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-07 17:58:21,499 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:21,499 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:21,499 INFO L410 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:21,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:21,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1421677387, now seen corresponding path program 1 times [2019-12-07 17:58:21,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:21,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85983337] [2019-12-07 17:58:21,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:21,545 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:58:21,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85983337] [2019-12-07 17:58:21,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:21,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:21,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119667899] [2019-12-07 17:58:21,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:21,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:21,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:21,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:21,546 INFO L87 Difference]: Start difference. First operand 416 states and 613 transitions. Second operand 4 states. [2019-12-07 17:58:21,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:21,855 INFO L93 Difference]: Finished difference Result 842 states and 1243 transitions. [2019-12-07 17:58:21,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:21,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-12-07 17:58:21,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:21,856 INFO L225 Difference]: With dead ends: 842 [2019-12-07 17:58:21,856 INFO L226 Difference]: Without dead ends: 445 [2019-12-07 17:58:21,856 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:21,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-12-07 17:58:21,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 416. [2019-12-07 17:58:21,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-12-07 17:58:21,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 612 transitions. [2019-12-07 17:58:21,869 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 612 transitions. Word has length 154 [2019-12-07 17:58:21,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:21,869 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 612 transitions. [2019-12-07 17:58:21,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:21,869 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 612 transitions. [2019-12-07 17:58:21,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-12-07 17:58:21,870 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:21,870 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:21,870 INFO L410 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:21,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:21,871 INFO L82 PathProgramCache]: Analyzing trace with hash -997861344, now seen corresponding path program 1 times [2019-12-07 17:58:21,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:21,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068918350] [2019-12-07 17:58:21,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:21,914 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:58:21,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068918350] [2019-12-07 17:58:21,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:21,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:21,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81326179] [2019-12-07 17:58:21,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:21,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:21,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:21,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:21,915 INFO L87 Difference]: Start difference. First operand 416 states and 612 transitions. Second operand 4 states. [2019-12-07 17:58:22,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:22,174 INFO L93 Difference]: Finished difference Result 842 states and 1241 transitions. [2019-12-07 17:58:22,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:22,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-12-07 17:58:22,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:22,175 INFO L225 Difference]: With dead ends: 842 [2019-12-07 17:58:22,175 INFO L226 Difference]: Without dead ends: 445 [2019-12-07 17:58:22,176 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:22,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-12-07 17:58:22,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 416. [2019-12-07 17:58:22,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-12-07 17:58:22,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 611 transitions. [2019-12-07 17:58:22,188 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 611 transitions. Word has length 155 [2019-12-07 17:58:22,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:22,188 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 611 transitions. [2019-12-07 17:58:22,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:22,188 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 611 transitions. [2019-12-07 17:58:22,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-12-07 17:58:22,189 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:22,189 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:22,189 INFO L410 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:22,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:22,189 INFO L82 PathProgramCache]: Analyzing trace with hash -124137697, now seen corresponding path program 1 times [2019-12-07 17:58:22,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:22,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588712307] [2019-12-07 17:58:22,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:22,232 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 17:58:22,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588712307] [2019-12-07 17:58:22,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:22,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:22,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693532182] [2019-12-07 17:58:22,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:22,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:22,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:22,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:22,233 INFO L87 Difference]: Start difference. First operand 416 states and 611 transitions. Second operand 4 states. [2019-12-07 17:58:22,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:22,523 INFO L93 Difference]: Finished difference Result 879 states and 1302 transitions. [2019-12-07 17:58:22,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:22,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-12-07 17:58:22,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:22,524 INFO L225 Difference]: With dead ends: 879 [2019-12-07 17:58:22,524 INFO L226 Difference]: Without dead ends: 482 [2019-12-07 17:58:22,525 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:22,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-12-07 17:58:22,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 446. [2019-12-07 17:58:22,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-12-07 17:58:22,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 664 transitions. [2019-12-07 17:58:22,538 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 664 transitions. Word has length 155 [2019-12-07 17:58:22,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:22,538 INFO L462 AbstractCegarLoop]: Abstraction has 446 states and 664 transitions. [2019-12-07 17:58:22,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:22,538 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 664 transitions. [2019-12-07 17:58:22,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 17:58:22,539 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:22,539 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:22,539 INFO L410 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:22,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:22,539 INFO L82 PathProgramCache]: Analyzing trace with hash 546507110, now seen corresponding path program 1 times [2019-12-07 17:58:22,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:22,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170170262] [2019-12-07 17:58:22,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:22,582 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:58:22,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170170262] [2019-12-07 17:58:22,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:22,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:22,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628979868] [2019-12-07 17:58:22,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:22,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:22,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:22,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:22,583 INFO L87 Difference]: Start difference. First operand 446 states and 664 transitions. Second operand 4 states. [2019-12-07 17:58:22,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:22,846 INFO L93 Difference]: Finished difference Result 900 states and 1343 transitions. [2019-12-07 17:58:22,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:22,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-12-07 17:58:22,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:22,847 INFO L225 Difference]: With dead ends: 900 [2019-12-07 17:58:22,847 INFO L226 Difference]: Without dead ends: 473 [2019-12-07 17:58:22,848 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:22,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-12-07 17:58:22,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 408. [2019-12-07 17:58:22,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-12-07 17:58:22,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 608 transitions. [2019-12-07 17:58:22,861 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 608 transitions. Word has length 156 [2019-12-07 17:58:22,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:22,861 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 608 transitions. [2019-12-07 17:58:22,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:22,861 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 608 transitions. [2019-12-07 17:58:22,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 17:58:22,862 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:22,862 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:22,862 INFO L410 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:22,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:22,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1786539332, now seen corresponding path program 1 times [2019-12-07 17:58:22,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:22,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736856004] [2019-12-07 17:58:22,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:22,905 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 17:58:22,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736856004] [2019-12-07 17:58:22,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:22,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:22,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139082058] [2019-12-07 17:58:22,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:22,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:22,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:22,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:22,906 INFO L87 Difference]: Start difference. First operand 408 states and 608 transitions. Second operand 4 states. [2019-12-07 17:58:23,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:23,163 INFO L93 Difference]: Finished difference Result 862 states and 1286 transitions. [2019-12-07 17:58:23,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:23,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-12-07 17:58:23,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:23,164 INFO L225 Difference]: With dead ends: 862 [2019-12-07 17:58:23,164 INFO L226 Difference]: Without dead ends: 473 [2019-12-07 17:58:23,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:23,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-12-07 17:58:23,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 438. [2019-12-07 17:58:23,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-12-07 17:58:23,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 653 transitions. [2019-12-07 17:58:23,178 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 653 transitions. Word has length 158 [2019-12-07 17:58:23,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:23,179 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 653 transitions. [2019-12-07 17:58:23,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:23,179 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 653 transitions. [2019-12-07 17:58:23,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 17:58:23,179 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:23,179 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:23,179 INFO L410 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:23,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:23,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1558443193, now seen corresponding path program 1 times [2019-12-07 17:58:23,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:23,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119589938] [2019-12-07 17:58:23,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:23,226 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-12-07 17:58:23,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119589938] [2019-12-07 17:58:23,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:23,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:23,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304255067] [2019-12-07 17:58:23,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:23,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:23,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:23,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:23,227 INFO L87 Difference]: Start difference. First operand 438 states and 653 transitions. Second operand 4 states. [2019-12-07 17:58:23,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:23,470 INFO L93 Difference]: Finished difference Result 881 states and 1318 transitions. [2019-12-07 17:58:23,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:23,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-12-07 17:58:23,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:23,470 INFO L225 Difference]: With dead ends: 881 [2019-12-07 17:58:23,471 INFO L226 Difference]: Without dead ends: 462 [2019-12-07 17:58:23,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:23,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-12-07 17:58:23,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 438. [2019-12-07 17:58:23,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-12-07 17:58:23,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 652 transitions. [2019-12-07 17:58:23,484 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 652 transitions. Word has length 158 [2019-12-07 17:58:23,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:23,484 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 652 transitions. [2019-12-07 17:58:23,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:23,485 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 652 transitions. [2019-12-07 17:58:23,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 17:58:23,485 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:23,485 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:23,485 INFO L410 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:23,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:23,485 INFO L82 PathProgramCache]: Analyzing trace with hash -359235427, now seen corresponding path program 1 times [2019-12-07 17:58:23,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:23,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564805062] [2019-12-07 17:58:23,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:23,528 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 17:58:23,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564805062] [2019-12-07 17:58:23,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:23,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:23,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203640547] [2019-12-07 17:58:23,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:23,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:23,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:23,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:23,529 INFO L87 Difference]: Start difference. First operand 438 states and 652 transitions. Second operand 4 states. [2019-12-07 17:58:23,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:23,788 INFO L93 Difference]: Finished difference Result 890 states and 1326 transitions. [2019-12-07 17:58:23,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:23,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-12-07 17:58:23,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:23,789 INFO L225 Difference]: With dead ends: 890 [2019-12-07 17:58:23,789 INFO L226 Difference]: Without dead ends: 471 [2019-12-07 17:58:23,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:23,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-12-07 17:58:23,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 439. [2019-12-07 17:58:23,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-12-07 17:58:23,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 653 transitions. [2019-12-07 17:58:23,803 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 653 transitions. Word has length 159 [2019-12-07 17:58:23,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:23,803 INFO L462 AbstractCegarLoop]: Abstraction has 439 states and 653 transitions. [2019-12-07 17:58:23,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:23,803 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 653 transitions. [2019-12-07 17:58:23,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 17:58:23,804 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:23,804 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:23,804 INFO L410 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:23,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:23,804 INFO L82 PathProgramCache]: Analyzing trace with hash 557596907, now seen corresponding path program 1 times [2019-12-07 17:58:23,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:23,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087094625] [2019-12-07 17:58:23,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-12-07 17:58:23,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087094625] [2019-12-07 17:58:23,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:23,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:58:23,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773926923] [2019-12-07 17:58:23,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:58:23,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:23,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:58:23,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:58:23,849 INFO L87 Difference]: Start difference. First operand 439 states and 653 transitions. Second operand 3 states. [2019-12-07 17:58:23,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:23,895 INFO L93 Difference]: Finished difference Result 1275 states and 1910 transitions. [2019-12-07 17:58:23,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:58:23,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-12-07 17:58:23,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:23,896 INFO L225 Difference]: With dead ends: 1275 [2019-12-07 17:58:23,896 INFO L226 Difference]: Without dead ends: 855 [2019-12-07 17:58:23,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:58:23,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-12-07 17:58:23,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 853. [2019-12-07 17:58:23,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2019-12-07 17:58:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1274 transitions. [2019-12-07 17:58:23,923 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1274 transitions. Word has length 159 [2019-12-07 17:58:23,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:23,923 INFO L462 AbstractCegarLoop]: Abstraction has 853 states and 1274 transitions. [2019-12-07 17:58:23,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:58:23,923 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1274 transitions. [2019-12-07 17:58:23,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 17:58:23,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:23,924 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:23,924 INFO L410 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:23,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:23,924 INFO L82 PathProgramCache]: Analyzing trace with hash 187706946, now seen corresponding path program 1 times [2019-12-07 17:58:23,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:23,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244402970] [2019-12-07 17:58:23,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:23,968 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-12-07 17:58:23,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244402970] [2019-12-07 17:58:23,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:23,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:23,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793278102] [2019-12-07 17:58:23,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:23,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:23,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:23,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:23,969 INFO L87 Difference]: Start difference. First operand 853 states and 1274 transitions. Second operand 4 states. [2019-12-07 17:58:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:24,251 INFO L93 Difference]: Finished difference Result 1731 states and 2590 transitions. [2019-12-07 17:58:24,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:24,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-12-07 17:58:24,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:24,252 INFO L225 Difference]: With dead ends: 1731 [2019-12-07 17:58:24,252 INFO L226 Difference]: Without dead ends: 897 [2019-12-07 17:58:24,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:24,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-12-07 17:58:24,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 853. [2019-12-07 17:58:24,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2019-12-07 17:58:24,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1272 transitions. [2019-12-07 17:58:24,280 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1272 transitions. Word has length 159 [2019-12-07 17:58:24,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:24,281 INFO L462 AbstractCegarLoop]: Abstraction has 853 states and 1272 transitions. [2019-12-07 17:58:24,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:24,281 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1272 transitions. [2019-12-07 17:58:24,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 17:58:24,281 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:24,281 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:24,282 INFO L410 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:24,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:24,282 INFO L82 PathProgramCache]: Analyzing trace with hash 769642896, now seen corresponding path program 1 times [2019-12-07 17:58:24,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:24,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871688849] [2019-12-07 17:58:24,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:58:24,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871688849] [2019-12-07 17:58:24,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:24,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:24,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504496721] [2019-12-07 17:58:24,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:24,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:24,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:24,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:24,328 INFO L87 Difference]: Start difference. First operand 853 states and 1272 transitions. Second operand 4 states. [2019-12-07 17:58:24,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:24,616 INFO L93 Difference]: Finished difference Result 1751 states and 2604 transitions. [2019-12-07 17:58:24,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:24,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-12-07 17:58:24,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:24,618 INFO L225 Difference]: With dead ends: 1751 [2019-12-07 17:58:24,618 INFO L226 Difference]: Without dead ends: 917 [2019-12-07 17:58:24,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:24,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2019-12-07 17:58:24,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 877. [2019-12-07 17:58:24,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2019-12-07 17:58:24,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1300 transitions. [2019-12-07 17:58:24,661 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1300 transitions. Word has length 160 [2019-12-07 17:58:24,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:24,661 INFO L462 AbstractCegarLoop]: Abstraction has 877 states and 1300 transitions. [2019-12-07 17:58:24,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:24,662 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1300 transitions. [2019-12-07 17:58:24,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 17:58:24,663 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:24,663 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:24,663 INFO L410 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:24,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:24,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1675384265, now seen corresponding path program 1 times [2019-12-07 17:58:24,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:24,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44555370] [2019-12-07 17:58:24,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:24,761 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 17:58:24,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44555370] [2019-12-07 17:58:24,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:24,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:58:24,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289461301] [2019-12-07 17:58:24,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:58:24,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:24,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:58:24,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:24,762 INFO L87 Difference]: Start difference. First operand 877 states and 1300 transitions. Second operand 5 states. [2019-12-07 17:58:25,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:25,271 INFO L93 Difference]: Finished difference Result 1887 states and 2812 transitions. [2019-12-07 17:58:25,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:58:25,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-12-07 17:58:25,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:25,272 INFO L225 Difference]: With dead ends: 1887 [2019-12-07 17:58:25,272 INFO L226 Difference]: Without dead ends: 1029 [2019-12-07 17:58:25,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:58:25,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2019-12-07 17:58:25,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 943. [2019-12-07 17:58:25,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-12-07 17:58:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1418 transitions. [2019-12-07 17:58:25,301 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1418 transitions. Word has length 160 [2019-12-07 17:58:25,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:25,301 INFO L462 AbstractCegarLoop]: Abstraction has 943 states and 1418 transitions. [2019-12-07 17:58:25,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:58:25,301 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1418 transitions. [2019-12-07 17:58:25,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-12-07 17:58:25,301 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:25,302 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:25,302 INFO L410 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:25,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:25,302 INFO L82 PathProgramCache]: Analyzing trace with hash -175567548, now seen corresponding path program 1 times [2019-12-07 17:58:25,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:25,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14181914] [2019-12-07 17:58:25,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:58:25,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14181914] [2019-12-07 17:58:25,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:25,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:25,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268356823] [2019-12-07 17:58:25,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:25,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:25,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:25,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:25,364 INFO L87 Difference]: Start difference. First operand 943 states and 1418 transitions. Second operand 4 states. [2019-12-07 17:58:25,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:25,661 INFO L93 Difference]: Finished difference Result 1899 states and 2856 transitions. [2019-12-07 17:58:25,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:25,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-12-07 17:58:25,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:25,662 INFO L225 Difference]: With dead ends: 1899 [2019-12-07 17:58:25,662 INFO L226 Difference]: Without dead ends: 971 [2019-12-07 17:58:25,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:25,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2019-12-07 17:58:25,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 941. [2019-12-07 17:58:25,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2019-12-07 17:58:25,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1414 transitions. [2019-12-07 17:58:25,691 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1414 transitions. Word has length 161 [2019-12-07 17:58:25,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:25,692 INFO L462 AbstractCegarLoop]: Abstraction has 941 states and 1414 transitions. [2019-12-07 17:58:25,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:25,692 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1414 transitions. [2019-12-07 17:58:25,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-12-07 17:58:25,692 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:25,692 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:25,693 INFO L410 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:25,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:25,693 INFO L82 PathProgramCache]: Analyzing trace with hash -101278629, now seen corresponding path program 1 times [2019-12-07 17:58:25,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:25,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423062675] [2019-12-07 17:58:25,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 17:58:25,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423062675] [2019-12-07 17:58:25,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:25,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:25,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652535453] [2019-12-07 17:58:25,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:25,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:25,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:25,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:25,743 INFO L87 Difference]: Start difference. First operand 941 states and 1414 transitions. Second operand 4 states. [2019-12-07 17:58:26,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:26,029 INFO L93 Difference]: Finished difference Result 1913 states and 2874 transitions. [2019-12-07 17:58:26,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:26,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-12-07 17:58:26,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:26,030 INFO L225 Difference]: With dead ends: 1913 [2019-12-07 17:58:26,030 INFO L226 Difference]: Without dead ends: 991 [2019-12-07 17:58:26,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:26,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-12-07 17:58:26,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 941. [2019-12-07 17:58:26,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2019-12-07 17:58:26,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1412 transitions. [2019-12-07 17:58:26,058 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1412 transitions. Word has length 163 [2019-12-07 17:58:26,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:26,059 INFO L462 AbstractCegarLoop]: Abstraction has 941 states and 1412 transitions. [2019-12-07 17:58:26,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:26,059 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1412 transitions. [2019-12-07 17:58:26,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-07 17:58:26,059 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:26,059 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:26,060 INFO L410 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:26,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:26,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1247949926, now seen corresponding path program 1 times [2019-12-07 17:58:26,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:26,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846055529] [2019-12-07 17:58:26,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:26,111 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 17:58:26,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846055529] [2019-12-07 17:58:26,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:26,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:26,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604589040] [2019-12-07 17:58:26,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:26,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:26,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:26,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:26,112 INFO L87 Difference]: Start difference. First operand 941 states and 1412 transitions. Second operand 4 states. [2019-12-07 17:58:26,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:26,374 INFO L93 Difference]: Finished difference Result 1909 states and 2866 transitions. [2019-12-07 17:58:26,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:26,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-12-07 17:58:26,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:26,376 INFO L225 Difference]: With dead ends: 1909 [2019-12-07 17:58:26,376 INFO L226 Difference]: Without dead ends: 987 [2019-12-07 17:58:26,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:26,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2019-12-07 17:58:26,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 941. [2019-12-07 17:58:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2019-12-07 17:58:26,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1410 transitions. [2019-12-07 17:58:26,405 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1410 transitions. Word has length 164 [2019-12-07 17:58:26,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:26,405 INFO L462 AbstractCegarLoop]: Abstraction has 941 states and 1410 transitions. [2019-12-07 17:58:26,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:26,405 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1410 transitions. [2019-12-07 17:58:26,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-07 17:58:26,406 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:26,406 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:26,406 INFO L410 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:26,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:26,406 INFO L82 PathProgramCache]: Analyzing trace with hash -2130185036, now seen corresponding path program 1 times [2019-12-07 17:58:26,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:26,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565015385] [2019-12-07 17:58:26,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:26,450 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-12-07 17:58:26,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565015385] [2019-12-07 17:58:26,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:26,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:58:26,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345563654] [2019-12-07 17:58:26,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:58:26,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:26,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:58:26,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:58:26,451 INFO L87 Difference]: Start difference. First operand 941 states and 1410 transitions. Second operand 3 states. [2019-12-07 17:58:26,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:26,530 INFO L93 Difference]: Finished difference Result 2321 states and 3491 transitions. [2019-12-07 17:58:26,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:58:26,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-12-07 17:58:26,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:26,531 INFO L225 Difference]: With dead ends: 2321 [2019-12-07 17:58:26,531 INFO L226 Difference]: Without dead ends: 1399 [2019-12-07 17:58:26,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:58:26,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2019-12-07 17:58:26,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1399. [2019-12-07 17:58:26,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1399 states. [2019-12-07 17:58:26,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 2096 transitions. [2019-12-07 17:58:26,574 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 2096 transitions. Word has length 164 [2019-12-07 17:58:26,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:26,574 INFO L462 AbstractCegarLoop]: Abstraction has 1399 states and 2096 transitions. [2019-12-07 17:58:26,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:58:26,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 2096 transitions. [2019-12-07 17:58:26,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-07 17:58:26,575 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:26,575 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:26,575 INFO L410 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:26,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:26,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1370865435, now seen corresponding path program 1 times [2019-12-07 17:58:26,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:26,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801976148] [2019-12-07 17:58:26,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:58:26,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801976148] [2019-12-07 17:58:26,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:26,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:58:26,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707041153] [2019-12-07 17:58:26,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:58:26,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:26,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:58:26,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:58:26,624 INFO L87 Difference]: Start difference. First operand 1399 states and 2096 transitions. Second operand 3 states. [2019-12-07 17:58:26,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:26,720 INFO L93 Difference]: Finished difference Result 3235 states and 4858 transitions. [2019-12-07 17:58:26,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:58:26,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-12-07 17:58:26,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:26,722 INFO L225 Difference]: With dead ends: 3235 [2019-12-07 17:58:26,722 INFO L226 Difference]: Without dead ends: 1855 [2019-12-07 17:58:26,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:58:26,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2019-12-07 17:58:26,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1851. [2019-12-07 17:58:26,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1851 states. [2019-12-07 17:58:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 2775 transitions. [2019-12-07 17:58:26,779 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 2775 transitions. Word has length 165 [2019-12-07 17:58:26,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:26,779 INFO L462 AbstractCegarLoop]: Abstraction has 1851 states and 2775 transitions. [2019-12-07 17:58:26,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:58:26,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2775 transitions. [2019-12-07 17:58:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 17:58:26,780 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:26,780 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:26,780 INFO L410 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:26,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:26,780 INFO L82 PathProgramCache]: Analyzing trace with hash 2108531887, now seen corresponding path program 1 times [2019-12-07 17:58:26,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:26,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271766463] [2019-12-07 17:58:26,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:26,821 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 17:58:26,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271766463] [2019-12-07 17:58:26,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:26,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:58:26,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373487724] [2019-12-07 17:58:26,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:58:26,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:26,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:58:26,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:58:26,822 INFO L87 Difference]: Start difference. First operand 1851 states and 2775 transitions. Second operand 3 states. [2019-12-07 17:58:26,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:26,920 INFO L93 Difference]: Finished difference Result 4100 states and 6160 transitions. [2019-12-07 17:58:26,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:58:26,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-12-07 17:58:26,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:26,922 INFO L225 Difference]: With dead ends: 4100 [2019-12-07 17:58:26,922 INFO L226 Difference]: Without dead ends: 2268 [2019-12-07 17:58:26,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:58:26,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2019-12-07 17:58:27,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 2264. [2019-12-07 17:58:27,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2019-12-07 17:58:27,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 3401 transitions. [2019-12-07 17:58:27,004 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 3401 transitions. Word has length 166 [2019-12-07 17:58:27,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:27,004 INFO L462 AbstractCegarLoop]: Abstraction has 2264 states and 3401 transitions. [2019-12-07 17:58:27,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:58:27,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 3401 transitions. [2019-12-07 17:58:27,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 17:58:27,005 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:27,005 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:27,005 INFO L410 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:27,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:27,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1674026289, now seen corresponding path program 1 times [2019-12-07 17:58:27,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:27,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670034798] [2019-12-07 17:58:27,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:27,035 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 17:58:27,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670034798] [2019-12-07 17:58:27,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:27,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:58:27,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983429132] [2019-12-07 17:58:27,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:58:27,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:27,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:58:27,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:58:27,036 INFO L87 Difference]: Start difference. First operand 2264 states and 3401 transitions. Second operand 3 states. [2019-12-07 17:58:27,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:27,138 INFO L93 Difference]: Finished difference Result 4536 states and 6817 transitions. [2019-12-07 17:58:27,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:58:27,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-12-07 17:58:27,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:27,140 INFO L225 Difference]: With dead ends: 4536 [2019-12-07 17:58:27,140 INFO L226 Difference]: Without dead ends: 2291 [2019-12-07 17:58:27,141 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:58:27,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2019-12-07 17:58:27,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2291. [2019-12-07 17:58:27,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2019-12-07 17:58:27,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3436 transitions. [2019-12-07 17:58:27,213 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3436 transitions. Word has length 166 [2019-12-07 17:58:27,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:27,214 INFO L462 AbstractCegarLoop]: Abstraction has 2291 states and 3436 transitions. [2019-12-07 17:58:27,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:58:27,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3436 transitions. [2019-12-07 17:58:27,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 17:58:27,215 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:27,215 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:27,215 INFO L410 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:27,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:27,215 INFO L82 PathProgramCache]: Analyzing trace with hash -689815373, now seen corresponding path program 1 times [2019-12-07 17:58:27,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:27,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225448914] [2019-12-07 17:58:27,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:27,242 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-12-07 17:58:27,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225448914] [2019-12-07 17:58:27,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:27,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:58:27,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972782178] [2019-12-07 17:58:27,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:58:27,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:27,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:58:27,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:58:27,243 INFO L87 Difference]: Start difference. First operand 2291 states and 3436 transitions. Second operand 3 states. [2019-12-07 17:58:27,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:27,312 INFO L93 Difference]: Finished difference Result 4109 states and 6166 transitions. [2019-12-07 17:58:27,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:58:27,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-12-07 17:58:27,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:27,314 INFO L225 Difference]: With dead ends: 4109 [2019-12-07 17:58:27,314 INFO L226 Difference]: Without dead ends: 1837 [2019-12-07 17:58:27,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:58:27,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2019-12-07 17:58:27,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1837. [2019-12-07 17:58:27,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1837 states. [2019-12-07 17:58:27,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2751 transitions. [2019-12-07 17:58:27,375 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2751 transitions. Word has length 166 [2019-12-07 17:58:27,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:27,375 INFO L462 AbstractCegarLoop]: Abstraction has 1837 states and 2751 transitions. [2019-12-07 17:58:27,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:58:27,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2751 transitions. [2019-12-07 17:58:27,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-12-07 17:58:27,376 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:27,376 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:27,376 INFO L410 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:27,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:27,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1229383242, now seen corresponding path program 1 times [2019-12-07 17:58:27,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:27,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550273976] [2019-12-07 17:58:27,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:27,417 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 17:58:27,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550273976] [2019-12-07 17:58:27,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:27,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:27,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337262451] [2019-12-07 17:58:27,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:27,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:27,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:27,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:27,418 INFO L87 Difference]: Start difference. First operand 1837 states and 2751 transitions. Second operand 4 states. [2019-12-07 17:58:27,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:27,802 INFO L93 Difference]: Finished difference Result 3798 states and 5665 transitions. [2019-12-07 17:58:27,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:27,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-12-07 17:58:27,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:27,805 INFO L225 Difference]: With dead ends: 3798 [2019-12-07 17:58:27,805 INFO L226 Difference]: Without dead ends: 1982 [2019-12-07 17:58:27,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:27,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2019-12-07 17:58:27,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1837. [2019-12-07 17:58:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1837 states. [2019-12-07 17:58:27,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2747 transitions. [2019-12-07 17:58:27,867 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2747 transitions. Word has length 170 [2019-12-07 17:58:27,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:27,867 INFO L462 AbstractCegarLoop]: Abstraction has 1837 states and 2747 transitions. [2019-12-07 17:58:27,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:27,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2747 transitions. [2019-12-07 17:58:27,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-12-07 17:58:27,868 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:27,868 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:27,868 INFO L410 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:27,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:27,868 INFO L82 PathProgramCache]: Analyzing trace with hash -2007517807, now seen corresponding path program 1 times [2019-12-07 17:58:27,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:27,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847916001] [2019-12-07 17:58:27,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:27,908 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 17:58:27,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847916001] [2019-12-07 17:58:27,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:27,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:27,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718927587] [2019-12-07 17:58:27,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:27,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:27,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:27,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:27,909 INFO L87 Difference]: Start difference. First operand 1837 states and 2747 transitions. Second operand 4 states. [2019-12-07 17:58:28,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:28,259 INFO L93 Difference]: Finished difference Result 3798 states and 5657 transitions. [2019-12-07 17:58:28,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:28,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-12-07 17:58:28,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:28,261 INFO L225 Difference]: With dead ends: 3798 [2019-12-07 17:58:28,261 INFO L226 Difference]: Without dead ends: 1982 [2019-12-07 17:58:28,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:28,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2019-12-07 17:58:28,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1837. [2019-12-07 17:58:28,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1837 states. [2019-12-07 17:58:28,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2743 transitions. [2019-12-07 17:58:28,323 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2743 transitions. Word has length 171 [2019-12-07 17:58:28,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:28,323 INFO L462 AbstractCegarLoop]: Abstraction has 1837 states and 2743 transitions. [2019-12-07 17:58:28,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:28,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2743 transitions. [2019-12-07 17:58:28,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-12-07 17:58:28,324 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:28,324 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:28,324 INFO L410 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:28,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:28,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1981654735, now seen corresponding path program 1 times [2019-12-07 17:58:28,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:28,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382166858] [2019-12-07 17:58:28,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 17:58:28,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382166858] [2019-12-07 17:58:28,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:28,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:28,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680262642] [2019-12-07 17:58:28,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:28,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:28,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:28,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:28,367 INFO L87 Difference]: Start difference. First operand 1837 states and 2743 transitions. Second operand 4 states. [2019-12-07 17:58:28,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:28,725 INFO L93 Difference]: Finished difference Result 3798 states and 5649 transitions. [2019-12-07 17:58:28,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:28,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-12-07 17:58:28,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:28,728 INFO L225 Difference]: With dead ends: 3798 [2019-12-07 17:58:28,728 INFO L226 Difference]: Without dead ends: 1982 [2019-12-07 17:58:28,729 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:28,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2019-12-07 17:58:28,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1837. [2019-12-07 17:58:28,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1837 states. [2019-12-07 17:58:28,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2739 transitions. [2019-12-07 17:58:28,791 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2739 transitions. Word has length 172 [2019-12-07 17:58:28,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:28,791 INFO L462 AbstractCegarLoop]: Abstraction has 1837 states and 2739 transitions. [2019-12-07 17:58:28,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:28,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2739 transitions. [2019-12-07 17:58:28,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-12-07 17:58:28,792 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:28,792 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:28,792 INFO L410 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:28,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:28,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1493298604, now seen corresponding path program 1 times [2019-12-07 17:58:28,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:28,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089884846] [2019-12-07 17:58:28,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:28,841 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 17:58:28,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089884846] [2019-12-07 17:58:28,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:28,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:28,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366347395] [2019-12-07 17:58:28,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:28,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:28,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:28,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:28,842 INFO L87 Difference]: Start difference. First operand 1837 states and 2739 transitions. Second operand 4 states. [2019-12-07 17:58:29,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:29,197 INFO L93 Difference]: Finished difference Result 3758 states and 5593 transitions. [2019-12-07 17:58:29,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:29,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-12-07 17:58:29,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:29,199 INFO L225 Difference]: With dead ends: 3758 [2019-12-07 17:58:29,199 INFO L226 Difference]: Without dead ends: 1942 [2019-12-07 17:58:29,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:29,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2019-12-07 17:58:29,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1837. [2019-12-07 17:58:29,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1837 states. [2019-12-07 17:58:29,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2735 transitions. [2019-12-07 17:58:29,262 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2735 transitions. Word has length 173 [2019-12-07 17:58:29,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:29,262 INFO L462 AbstractCegarLoop]: Abstraction has 1837 states and 2735 transitions. [2019-12-07 17:58:29,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:29,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2735 transitions. [2019-12-07 17:58:29,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-12-07 17:58:29,263 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:29,264 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:29,264 INFO L410 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:29,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:29,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1144465868, now seen corresponding path program 1 times [2019-12-07 17:58:29,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:29,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133906324] [2019-12-07 17:58:29,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:29,353 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-12-07 17:58:29,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133906324] [2019-12-07 17:58:29,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:29,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:58:29,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264727144] [2019-12-07 17:58:29,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:58:29,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:29,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:58:29,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:29,354 INFO L87 Difference]: Start difference. First operand 1837 states and 2735 transitions. Second operand 5 states. [2019-12-07 17:58:29,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:29,767 INFO L93 Difference]: Finished difference Result 4097 states and 6119 transitions. [2019-12-07 17:58:29,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:29,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-12-07 17:58:29,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:29,769 INFO L225 Difference]: With dead ends: 4097 [2019-12-07 17:58:29,769 INFO L226 Difference]: Without dead ends: 2281 [2019-12-07 17:58:29,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:58:29,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2019-12-07 17:58:29,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 1996. [2019-12-07 17:58:29,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1996 states. [2019-12-07 17:58:29,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 3022 transitions. [2019-12-07 17:58:29,834 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 3022 transitions. Word has length 175 [2019-12-07 17:58:29,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:29,834 INFO L462 AbstractCegarLoop]: Abstraction has 1996 states and 3022 transitions. [2019-12-07 17:58:29,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:58:29,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 3022 transitions. [2019-12-07 17:58:29,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-12-07 17:58:29,835 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:29,835 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:29,835 INFO L410 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:29,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:29,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1112170898, now seen corresponding path program 1 times [2019-12-07 17:58:29,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:29,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207756116] [2019-12-07 17:58:29,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:29,905 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-12-07 17:58:29,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207756116] [2019-12-07 17:58:29,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:29,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:58:29,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990927833] [2019-12-07 17:58:29,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:58:29,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:29,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:58:29,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:29,906 INFO L87 Difference]: Start difference. First operand 1996 states and 3022 transitions. Second operand 5 states. [2019-12-07 17:58:30,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:30,336 INFO L93 Difference]: Finished difference Result 4368 states and 6626 transitions. [2019-12-07 17:58:30,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:30,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-12-07 17:58:30,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:30,338 INFO L225 Difference]: With dead ends: 4368 [2019-12-07 17:58:30,338 INFO L226 Difference]: Without dead ends: 2393 [2019-12-07 17:58:30,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:58:30,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2019-12-07 17:58:30,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2106. [2019-12-07 17:58:30,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2019-12-07 17:58:30,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 3244 transitions. [2019-12-07 17:58:30,410 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 3244 transitions. Word has length 176 [2019-12-07 17:58:30,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:30,410 INFO L462 AbstractCegarLoop]: Abstraction has 2106 states and 3244 transitions. [2019-12-07 17:58:30,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:58:30,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 3244 transitions. [2019-12-07 17:58:30,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-12-07 17:58:30,411 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:30,411 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:30,411 INFO L410 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:30,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:30,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1394677973, now seen corresponding path program 1 times [2019-12-07 17:58:30,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:30,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997336991] [2019-12-07 17:58:30,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:30,669 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 17:58:30,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997336991] [2019-12-07 17:58:30,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866406819] [2019-12-07 17:58:30,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:58:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:30,799 INFO L264 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-07 17:58:30,822 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:58:30,886 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:30,886 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-12-07 17:58:30,887 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:30,911 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:30,913 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_165|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-12-07 17:58:30,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:30,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:30,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:30,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:30,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:30,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:30,942 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 17:58:30,942 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:30,964 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:30,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:30,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:30,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:30,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:30,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:30,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:30,977 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 17:58:30,978 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:30,994 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:31,016 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:58:31,017 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 17:58:31,017 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:31,026 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:31,026 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:31,027 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-12-07 17:58:31,058 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:58:31,058 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:58:31,059 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:31,064 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:31,065 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:31,065 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:58:31,089 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:58:31,089 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:58:31,090 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:31,095 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:31,095 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:31,096 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:58:31,098 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_168|]} [2019-12-07 17:58:31,101 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:58:31,113 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:31,146 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 17:58:31,146 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 17:58:31,147 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:31,153 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:31,154 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:31,154 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 17:58:31,178 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:58:31,178 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:58:31,179 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:31,184 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:31,184 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:31,185 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:58:31,205 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:58:31,205 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:58:31,206 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:31,213 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:31,213 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:31,213 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:58:31,217 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 12=[|v_#memory_$Pointer$.base_171|]} [2019-12-07 17:58:31,219 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:58:31,229 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:31,262 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 17:58:31,262 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 17:58:31,263 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:31,269 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:31,270 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:31,270 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 17:58:31,274 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_160|], 12=[|v_#memory_$Pointer$.base_172|]} [2019-12-07 17:58:31,276 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-12-07 17:58:31,276 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:58:31,285 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:31,354 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 17:58:31,354 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-12-07 17:58:31,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:58:31,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:58:31,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:58:31,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:58:31,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,374 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-12-07 17:58:31,438 INFO L614 ElimStorePlain]: treesize reduction 1116, result has 4.5 percent of original size [2019-12-07 17:58:31,438 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:31,438 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 17:58:31,440 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_162|], 12=[|v_#memory_$Pointer$.base_173|]} [2019-12-07 17:58:31,442 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:58:31,452 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:31,486 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 17:58:31,486 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 17:58:31,486 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:31,493 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:31,493 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:31,493 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 17:58:31,498 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_161|], 12=[|v_#memory_$Pointer$.base_174|]} [2019-12-07 17:58:31,500 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-12-07 17:58:31,500 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:58:31,508 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:31,576 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 17:58:31,576 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-12-07 17:58:31,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,579 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:31,601 INFO L614 ElimStorePlain]: treesize reduction 157, result has 25.2 percent of original size [2019-12-07 17:58:31,601 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:31,601 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 17:58:31,604 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 2=[|v_#memory_$Pointer$.offset_158|, |v_#memory_$Pointer$.offset_159|, |v_#memory_$Pointer$.base_163|], 6=[|v_#memory_$Pointer$.base_164|], 12=[|v_#memory_$Pointer$.base_175|]} [2019-12-07 17:58:31,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,614 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2019-12-07 17:58:31,614 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:31,665 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:31,668 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:58:31,712 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:31,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,718 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 80 [2019-12-07 17:58:31,718 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:31,752 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:31,754 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:58:31,784 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:31,786 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:58:31,817 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:31,820 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 186 [2019-12-07 17:58:31,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,834 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 134 [2019-12-07 17:58:31,834 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:31,856 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:31,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:31,948 INFO L343 Elim1Store]: treesize reduction 152, result has 48.3 percent of original size [2019-12-07 17:58:31,948 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 179 treesize of output 194 [2019-12-07 17:58:31,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:31,951 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:31,989 INFO L614 ElimStorePlain]: treesize reduction 97, result has 56.3 percent of original size [2019-12-07 17:58:31,989 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:32,006 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:32,006 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:32,007 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:317, output treesize:92 [2019-12-07 17:58:32,031 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_162|], 6=[|v_#memory_$Pointer$.base_176|], 12=[|v_#memory_int_179|]} [2019-12-07 17:58:32,034 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2019-12-07 17:58:32,034 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:58:32,049 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:32,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:32,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:32,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:58:32,053 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 45 [2019-12-07 17:58:32,054 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:58:32,061 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:32,068 INFO L343 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2019-12-07 17:58:32,069 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 17:58:32,069 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:32,077 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:32,078 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:58:32,078 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:123, output treesize:38 [2019-12-07 17:58:32,363 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 17:58:32,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:58:32,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-12-07 17:58:32,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82492519] [2019-12-07 17:58:32,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:58:32,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:32,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:58:32,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:58:32,364 INFO L87 Difference]: Start difference. First operand 2106 states and 3244 transitions. Second operand 10 states. [2019-12-07 17:58:35,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:35,241 INFO L93 Difference]: Finished difference Result 9018 states and 13783 transitions. [2019-12-07 17:58:35,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:58:35,242 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 189 [2019-12-07 17:58:35,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:35,257 INFO L225 Difference]: With dead ends: 9018 [2019-12-07 17:58:35,257 INFO L226 Difference]: Without dead ends: 6933 [2019-12-07 17:58:35,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:58:35,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6933 states. [2019-12-07 17:58:35,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6933 to 4627. [2019-12-07 17:58:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4627 states. [2019-12-07 17:58:35,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4627 states to 4627 states and 7269 transitions. [2019-12-07 17:58:35,440 INFO L78 Accepts]: Start accepts. Automaton has 4627 states and 7269 transitions. Word has length 189 [2019-12-07 17:58:35,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:35,440 INFO L462 AbstractCegarLoop]: Abstraction has 4627 states and 7269 transitions. [2019-12-07 17:58:35,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:58:35,440 INFO L276 IsEmpty]: Start isEmpty. Operand 4627 states and 7269 transitions. [2019-12-07 17:58:35,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-12-07 17:58:35,445 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:35,446 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:35,646 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:58:35,647 INFO L410 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:35,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:35,648 INFO L82 PathProgramCache]: Analyzing trace with hash -261029862, now seen corresponding path program 1 times [2019-12-07 17:58:35,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:35,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682315799] [2019-12-07 17:58:35,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-12-07 17:58:35,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682315799] [2019-12-07 17:58:35,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:35,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:35,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670358819] [2019-12-07 17:58:35,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:35,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:35,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:35,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:35,798 INFO L87 Difference]: Start difference. First operand 4627 states and 7269 transitions. Second operand 4 states. [2019-12-07 17:58:36,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:36,260 INFO L93 Difference]: Finished difference Result 9443 states and 14792 transitions. [2019-12-07 17:58:36,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:36,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-12-07 17:58:36,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:36,266 INFO L225 Difference]: With dead ends: 9443 [2019-12-07 17:58:36,266 INFO L226 Difference]: Without dead ends: 4837 [2019-12-07 17:58:36,268 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:36,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4837 states. [2019-12-07 17:58:36,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4837 to 4627. [2019-12-07 17:58:36,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4627 states. [2019-12-07 17:58:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4627 states to 4627 states and 7261 transitions. [2019-12-07 17:58:36,455 INFO L78 Accepts]: Start accepts. Automaton has 4627 states and 7261 transitions. Word has length 197 [2019-12-07 17:58:36,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:36,455 INFO L462 AbstractCegarLoop]: Abstraction has 4627 states and 7261 transitions. [2019-12-07 17:58:36,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:36,455 INFO L276 IsEmpty]: Start isEmpty. Operand 4627 states and 7261 transitions. [2019-12-07 17:58:36,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-12-07 17:58:36,458 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:36,458 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:36,458 INFO L410 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:36,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:36,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1822723231, now seen corresponding path program 1 times [2019-12-07 17:58:36,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:36,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14728672] [2019-12-07 17:58:36,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:36,511 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-12-07 17:58:36,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14728672] [2019-12-07 17:58:36,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:36,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:58:36,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122928981] [2019-12-07 17:58:36,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:36,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:36,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:36,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:36,512 INFO L87 Difference]: Start difference. First operand 4627 states and 7261 transitions. Second operand 4 states. [2019-12-07 17:58:36,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:36,948 INFO L93 Difference]: Finished difference Result 9427 states and 14760 transitions. [2019-12-07 17:58:36,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:36,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-12-07 17:58:36,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:36,953 INFO L225 Difference]: With dead ends: 9427 [2019-12-07 17:58:36,953 INFO L226 Difference]: Without dead ends: 4821 [2019-12-07 17:58:36,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:36,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4821 states. [2019-12-07 17:58:37,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4821 to 4627. [2019-12-07 17:58:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4627 states. [2019-12-07 17:58:37,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4627 states to 4627 states and 7253 transitions. [2019-12-07 17:58:37,118 INFO L78 Accepts]: Start accepts. Automaton has 4627 states and 7253 transitions. Word has length 198 [2019-12-07 17:58:37,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:37,119 INFO L462 AbstractCegarLoop]: Abstraction has 4627 states and 7253 transitions. [2019-12-07 17:58:37,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:37,119 INFO L276 IsEmpty]: Start isEmpty. Operand 4627 states and 7253 transitions. [2019-12-07 17:58:37,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-12-07 17:58:37,121 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:37,122 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:37,122 INFO L410 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:37,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:37,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1499491772, now seen corresponding path program 1 times [2019-12-07 17:58:37,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:37,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892720060] [2019-12-07 17:58:37,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:37,224 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-12-07 17:58:37,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892720060] [2019-12-07 17:58:37,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:37,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:58:37,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848722731] [2019-12-07 17:58:37,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:58:37,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:37,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:58:37,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:58:37,225 INFO L87 Difference]: Start difference. First operand 4627 states and 7253 transitions. Second operand 6 states. [2019-12-07 17:58:38,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:38,224 INFO L93 Difference]: Finished difference Result 10623 states and 16617 transitions. [2019-12-07 17:58:38,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:58:38,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 202 [2019-12-07 17:58:38,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:38,229 INFO L225 Difference]: With dead ends: 10623 [2019-12-07 17:58:38,229 INFO L226 Difference]: Without dead ends: 6017 [2019-12-07 17:58:38,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:58:38,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2019-12-07 17:58:38,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 4695. [2019-12-07 17:58:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4695 states. [2019-12-07 17:58:38,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4695 states to 4695 states and 7357 transitions. [2019-12-07 17:58:38,388 INFO L78 Accepts]: Start accepts. Automaton has 4695 states and 7357 transitions. Word has length 202 [2019-12-07 17:58:38,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:38,389 INFO L462 AbstractCegarLoop]: Abstraction has 4695 states and 7357 transitions. [2019-12-07 17:58:38,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:58:38,389 INFO L276 IsEmpty]: Start isEmpty. Operand 4695 states and 7357 transitions. [2019-12-07 17:58:38,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-12-07 17:58:38,391 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:38,391 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:38,391 INFO L410 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:38,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:38,391 INFO L82 PathProgramCache]: Analyzing trace with hash 2085109685, now seen corresponding path program 1 times [2019-12-07 17:58:38,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:38,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174309623] [2019-12-07 17:58:38,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:38,476 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-12-07 17:58:38,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174309623] [2019-12-07 17:58:38,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:38,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:58:38,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666437820] [2019-12-07 17:58:38,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:58:38,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:38,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:58:38,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:58:38,477 INFO L87 Difference]: Start difference. First operand 4695 states and 7357 transitions. Second operand 6 states. [2019-12-07 17:58:39,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:39,459 INFO L93 Difference]: Finished difference Result 10323 states and 16053 transitions. [2019-12-07 17:58:39,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:58:39,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 203 [2019-12-07 17:58:39,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:39,464 INFO L225 Difference]: With dead ends: 10323 [2019-12-07 17:58:39,464 INFO L226 Difference]: Without dead ends: 5649 [2019-12-07 17:58:39,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:58:39,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5649 states. [2019-12-07 17:58:39,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5649 to 4699. [2019-12-07 17:58:39,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4699 states. [2019-12-07 17:58:39,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4699 states to 4699 states and 7345 transitions. [2019-12-07 17:58:39,624 INFO L78 Accepts]: Start accepts. Automaton has 4699 states and 7345 transitions. Word has length 203 [2019-12-07 17:58:39,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:39,624 INFO L462 AbstractCegarLoop]: Abstraction has 4699 states and 7345 transitions. [2019-12-07 17:58:39,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:58:39,624 INFO L276 IsEmpty]: Start isEmpty. Operand 4699 states and 7345 transitions. [2019-12-07 17:58:39,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-12-07 17:58:39,626 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:39,626 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:39,626 INFO L410 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:39,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:39,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1958552144, now seen corresponding path program 1 times [2019-12-07 17:58:39,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:39,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647375217] [2019-12-07 17:58:39,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:39,723 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-12-07 17:58:39,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647375217] [2019-12-07 17:58:39,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:39,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:58:39,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412400430] [2019-12-07 17:58:39,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:58:39,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:39,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:58:39,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:39,724 INFO L87 Difference]: Start difference. First operand 4699 states and 7345 transitions. Second operand 5 states. [2019-12-07 17:58:40,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:40,327 INFO L93 Difference]: Finished difference Result 10291 states and 16071 transitions. [2019-12-07 17:58:40,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:40,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 209 [2019-12-07 17:58:40,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:40,331 INFO L225 Difference]: With dead ends: 10291 [2019-12-07 17:58:40,331 INFO L226 Difference]: Without dead ends: 5613 [2019-12-07 17:58:40,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:58:40,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5613 states. [2019-12-07 17:58:40,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5613 to 4995. [2019-12-07 17:58:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4995 states. [2019-12-07 17:58:40,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4995 states to 4995 states and 7865 transitions. [2019-12-07 17:58:40,493 INFO L78 Accepts]: Start accepts. Automaton has 4995 states and 7865 transitions. Word has length 209 [2019-12-07 17:58:40,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:40,494 INFO L462 AbstractCegarLoop]: Abstraction has 4995 states and 7865 transitions. [2019-12-07 17:58:40,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:58:40,494 INFO L276 IsEmpty]: Start isEmpty. Operand 4995 states and 7865 transitions. [2019-12-07 17:58:40,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-12-07 17:58:40,496 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:40,496 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:40,496 INFO L410 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:40,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:40,497 INFO L82 PathProgramCache]: Analyzing trace with hash 2001012022, now seen corresponding path program 1 times [2019-12-07 17:58:40,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:40,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65275894] [2019-12-07 17:58:40,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:40,580 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-12-07 17:58:40,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65275894] [2019-12-07 17:58:40,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:40,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:58:40,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70372248] [2019-12-07 17:58:40,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:58:40,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:40,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:58:40,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:40,581 INFO L87 Difference]: Start difference. First operand 4995 states and 7865 transitions. Second operand 5 states. [2019-12-07 17:58:41,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:41,161 INFO L93 Difference]: Finished difference Result 10563 states and 16543 transitions. [2019-12-07 17:58:41,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:41,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-12-07 17:58:41,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:41,165 INFO L225 Difference]: With dead ends: 10563 [2019-12-07 17:58:41,165 INFO L226 Difference]: Without dead ends: 5589 [2019-12-07 17:58:41,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:58:41,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5589 states. [2019-12-07 17:58:41,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5589 to 4983. [2019-12-07 17:58:41,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4983 states. [2019-12-07 17:58:41,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4983 states to 4983 states and 7837 transitions. [2019-12-07 17:58:41,340 INFO L78 Accepts]: Start accepts. Automaton has 4983 states and 7837 transitions. Word has length 210 [2019-12-07 17:58:41,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:41,340 INFO L462 AbstractCegarLoop]: Abstraction has 4983 states and 7837 transitions. [2019-12-07 17:58:41,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:58:41,340 INFO L276 IsEmpty]: Start isEmpty. Operand 4983 states and 7837 transitions. [2019-12-07 17:58:41,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-12-07 17:58:41,343 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:41,343 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:41,343 INFO L410 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:41,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:41,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1442165383, now seen corresponding path program 1 times [2019-12-07 17:58:41,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:58:41,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812372560] [2019-12-07 17:58:41,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:58:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:41,429 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 307 proven. 4 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-12-07 17:58:41,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812372560] [2019-12-07 17:58:41,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841685223] [2019-12-07 17:58:41,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:58:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:41,548 INFO L264 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 17:58:41,556 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:58:41,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-12-07 17:58:41,571 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:41,572 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:41,572 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:41,572 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-12-07 17:58:41,582 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_177|, |v_#memory_$Pointer$.offset_163|], 5=[|v_#memory_int_180|]} [2019-12-07 17:58:41,583 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 63 [2019-12-07 17:58:41,584 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:58:41,586 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:41,588 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2019-12-07 17:58:41,588 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:58:41,590 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:41,613 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:41,614 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 141 [2019-12-07 17:58:41,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:41,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:41,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:41,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:58:41,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:41,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:58:41,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:58:41,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:41,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:41,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:58:41,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:58:41,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:58:41,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:58:41,623 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@239f1f49 [2019-12-07 17:58:41,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:58:41,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-12-07 17:58:41,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139241751] [2019-12-07 17:58:41,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:58:41,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:58:41,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:58:41,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:58:41,624 INFO L87 Difference]: Start difference. First operand 4983 states and 7837 transitions. Second operand 6 states. [2019-12-07 17:58:41,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 17:58:41,824 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:58:41,825 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@239f1f49 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 17:58:41,833 INFO L168 Benchmark]: Toolchain (without parser) took 51714.39 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 657.5 MB). Free memory was 940.7 MB in the beginning and 1.4 GB in the end (delta: -456.3 MB). Peak memory consumption was 201.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:58:41,834 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:58:41,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 412.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -132.3 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:58:41,835 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.47 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-12-07 17:58:41,836 INFO L168 Benchmark]: Boogie Preprocessor took 72.48 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:58:41,836 INFO L168 Benchmark]: RCFGBuilder took 701.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 962.0 MB in the end (delta: 100.3 MB). Peak memory consumption was 100.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:58:41,837 INFO L168 Benchmark]: TraceAbstraction took 50463.84 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 557.3 MB). Free memory was 962.0 MB in the beginning and 1.4 GB in the end (delta: -435.0 MB). Peak memory consumption was 122.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:58:41,841 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 412.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -132.3 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.47 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 72.48 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 701.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 962.0 MB in the end (delta: 100.3 MB). Peak memory consumption was 100.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 50463.84 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 557.3 MB). Free memory was 962.0 MB in the beginning and 1.4 GB in the end (delta: -435.0 MB). Peak memory consumption was 122.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@239f1f49 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@239f1f49: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 17:58:43,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:58:43,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:58:43,181 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:58:43,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:58:43,182 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:58:43,183 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:58:43,184 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:58:43,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:58:43,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:58:43,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:58:43,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:58:43,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:58:43,189 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:58:43,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:58:43,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:58:43,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:58:43,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:58:43,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:58:43,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:58:43,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:58:43,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:58:43,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:58:43,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:58:43,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:58:43,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:58:43,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:58:43,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:58:43,203 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:58:43,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:58:43,204 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:58:43,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:58:43,205 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:58:43,206 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:58:43,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:58:43,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:58:43,207 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:58:43,207 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:58:43,207 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:58:43,208 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:58:43,208 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:58:43,209 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 17:58:43,221 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:58:43,222 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:58:43,223 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:58:43,223 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:58:43,223 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:58:43,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:58:43,224 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:58:43,224 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:58:43,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:58:43,224 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:58:43,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:58:43,225 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:58:43,225 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 17:58:43,225 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 17:58:43,225 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:58:43,225 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:58:43,226 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:58:43,226 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:58:43,226 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:58:43,226 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:58:43,226 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:58:43,227 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:58:43,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:58:43,227 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:58:43,227 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:58:43,227 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:58:43,228 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 17:58:43,228 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 17:58:43,228 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:58:43,228 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:58:43,228 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 17:58:43,228 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_de8d4909-bda7-407a-a0c3-ba81d098d28f/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 -> 24241c008259f315336df16b66c76f690577877c [2019-12-07 17:58:43,414 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:58:43,425 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:58:43,428 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:58:43,429 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:58:43,429 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:58:43,430 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-2.c [2019-12-07 17:58:43,471 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/data/844d450ae/81e33d53be064b079b7311035df8408f/FLAG4316bc078 [2019-12-07 17:58:43,890 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:58:43,890 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-2.c [2019-12-07 17:58:43,907 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/data/844d450ae/81e33d53be064b079b7311035df8408f/FLAG4316bc078 [2019-12-07 17:58:43,918 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/data/844d450ae/81e33d53be064b079b7311035df8408f [2019-12-07 17:58:43,921 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:58:43,922 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:58:43,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:58:43,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:58:43,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:58:43,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:58:43" (1/1) ... [2019-12-07 17:58:43,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10831c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:58:43, skipping insertion in model container [2019-12-07 17:58:43,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:58:43" (1/1) ... [2019-12-07 17:58:43,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:58:43,971 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:58:44,246 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:58:44,258 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:58:44,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:58:44,342 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:58:44,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:58:44 WrapperNode [2019-12-07 17:58:44,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:58:44,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:58:44,343 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:58:44,343 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:58:44,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:58:44" (1/1) ... [2019-12-07 17:58:44,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:58:44" (1/1) ... [2019-12-07 17:58:44,398 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:58:44,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:58:44,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:58:44,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:58:44,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:58:44" (1/1) ... [2019-12-07 17:58:44,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:58:44" (1/1) ... [2019-12-07 17:58:44,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:58:44" (1/1) ... [2019-12-07 17:58:44,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:58:44" (1/1) ... [2019-12-07 17:58:44,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:58:44" (1/1) ... [2019-12-07 17:58:44,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:58:44" (1/1) ... [2019-12-07 17:58:44,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:58:44" (1/1) ... [2019-12-07 17:58:44,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:58:44,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:58:44,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:58:44,453 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:58:44,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:58:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:58:44,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 17:58:44,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:58:44,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 17:58:44,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 17:58:44,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 17:58:44,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:58:44,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:58:44,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 17:58:44,649 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 17:58:47,129 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 17:58:47,129 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 17:58:47,130 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:58:47,130 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 17:58:47,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:58:47 BoogieIcfgContainer [2019-12-07 17:58:47,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:58:47,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:58:47,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:58:47,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:58:47,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:58:43" (1/3) ... [2019-12-07 17:58:47,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f25fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:58:47, skipping insertion in model container [2019-12-07 17:58:47,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:58:44" (2/3) ... [2019-12-07 17:58:47,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f25fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:58:47, skipping insertion in model container [2019-12-07 17:58:47,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:58:47" (3/3) ... [2019-12-07 17:58:47,138 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.10.i.cil-2.c [2019-12-07 17:58:47,145 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:58:47,149 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:58:47,157 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:58:47,175 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:58:47,175 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:58:47,176 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:58:47,176 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:58:47,176 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:58:47,176 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:58:47,176 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:58:47,176 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:58:47,190 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-12-07 17:58:47,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 17:58:47,197 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:47,198 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:47,198 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:47,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:47,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1126320416, now seen corresponding path program 1 times [2019-12-07 17:58:47,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:58:47,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781784414] [2019-12-07 17:58:47,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 17:58:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:47,379 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:58:47,386 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:58:47,447 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:58:47,448 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 17:58:47,449 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:47,461 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:47,462 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:47,462 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 17:58:47,495 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 17:58:47,496 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 17:58:47,498 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:47,501 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:47,502 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:47,502 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 17:58:47,508 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:58:47,508 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:47,510 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:47,510 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:47,510 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:58:47,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:58:47,527 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:58:47,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:58:47,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781784414] [2019-12-07 17:58:47,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:47,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 17:58:47,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386474655] [2019-12-07 17:58:47,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:58:47,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:58:47,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:58:47,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:58:47,568 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 4 states. [2019-12-07 17:58:49,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:49,605 INFO L93 Difference]: Finished difference Result 317 states and 535 transitions. [2019-12-07 17:58:49,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:58:49,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-07 17:58:49,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:49,616 INFO L225 Difference]: With dead ends: 317 [2019-12-07 17:58:49,616 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 17:58:49,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:58:49,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 17:58:49,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2019-12-07 17:58:49,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-12-07 17:58:49,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 220 transitions. [2019-12-07 17:58:49,652 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 220 transitions. Word has length 41 [2019-12-07 17:58:49,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:49,652 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 220 transitions. [2019-12-07 17:58:49,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:58:49,652 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 220 transitions. [2019-12-07 17:58:49,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 17:58:49,654 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:49,655 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:49,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 17:58:49,856 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:49,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:49,857 INFO L82 PathProgramCache]: Analyzing trace with hash -589138407, now seen corresponding path program 1 times [2019-12-07 17:58:49,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:58:49,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938730117] [2019-12-07 17:58:49,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 17:58:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:50,049 INFO L264 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:58:50,052 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:58:50,072 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:58:50,073 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 17:58:50,073 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:50,084 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:50,085 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:50,085 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 17:58:50,109 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 17:58:50,109 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 17:58:50,110 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:50,113 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:50,113 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:50,113 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 17:58:50,118 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:58:50,119 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:50,121 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:50,121 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:50,121 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:58:50,133 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:58:50,133 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:58:50,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:58:50,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938730117] [2019-12-07 17:58:50,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:50,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:58:50,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518969238] [2019-12-07 17:58:50,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:58:50,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:58:50,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:58:50,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:58:50,171 INFO L87 Difference]: Start difference. First operand 143 states and 220 transitions. Second operand 6 states. [2019-12-07 17:58:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:56,403 INFO L93 Difference]: Finished difference Result 399 states and 609 transitions. [2019-12-07 17:58:56,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:58:56,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-07 17:58:56,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:56,406 INFO L225 Difference]: With dead ends: 399 [2019-12-07 17:58:56,406 INFO L226 Difference]: Without dead ends: 275 [2019-12-07 17:58:56,407 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:58:56,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-12-07 17:58:56,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 159. [2019-12-07 17:58:56,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-12-07 17:58:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 245 transitions. [2019-12-07 17:58:56,417 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 245 transitions. Word has length 54 [2019-12-07 17:58:56,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:56,417 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 245 transitions. [2019-12-07 17:58:56,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:58:56,417 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 245 transitions. [2019-12-07 17:58:56,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 17:58:56,419 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:56,419 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:56,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 17:58:56,620 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:56,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:56,621 INFO L82 PathProgramCache]: Analyzing trace with hash -873991893, now seen corresponding path program 1 times [2019-12-07 17:58:56,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:58:56,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954246174] [2019-12-07 17:58:56,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 17:58:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:56,776 INFO L264 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:58:56,779 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:58:56,782 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_164|, |v_#memory_$Pointer$.base_164|], 4=[|v_#memory_int_188|]} [2019-12-07 17:58:56,784 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 85 [2019-12-07 17:58:56,785 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:58:56,792 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:56,794 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 49 [2019-12-07 17:58:56,795 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:58:56,802 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:56,834 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:56,834 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 55 [2019-12-07 17:58:56,835 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:04,945 WARN L192 SmtUtils]: Spent 8.11 s on a formula simplification that was a NOOP. DAG size: 22 [2019-12-07 17:59:04,945 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:04,946 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:04,946 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-12-07 17:59:04,955 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:59:04,955 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:04,957 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:04,957 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:04,957 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:59:04,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:59:04,964 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:59:04,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:59:04,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954246174] [2019-12-07 17:59:04,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:59:04,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 17:59:04,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375928773] [2019-12-07 17:59:04,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:59:04,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:59:04,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:59:04,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:59:04,970 INFO L87 Difference]: Start difference. First operand 159 states and 245 transitions. Second operand 4 states. [2019-12-07 17:59:08,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:59:08,296 INFO L93 Difference]: Finished difference Result 328 states and 504 transitions. [2019-12-07 17:59:08,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:59:08,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-07 17:59:08,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:59:08,299 INFO L225 Difference]: With dead ends: 328 [2019-12-07 17:59:08,299 INFO L226 Difference]: Without dead ends: 188 [2019-12-07 17:59:08,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:59:08,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-12-07 17:59:08,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2019-12-07 17:59:08,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-12-07 17:59:08,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 271 transitions. [2019-12-07 17:59:08,307 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 271 transitions. Word has length 55 [2019-12-07 17:59:08,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:59:08,307 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 271 transitions. [2019-12-07 17:59:08,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:59:08,307 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 271 transitions. [2019-12-07 17:59:08,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 17:59:08,309 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:08,309 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:59:08,509 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 17:59:08,510 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:08,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:08,511 INFO L82 PathProgramCache]: Analyzing trace with hash -2010193898, now seen corresponding path program 1 times [2019-12-07 17:59:08,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:59:08,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274892323] [2019-12-07 17:59:08,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 17:59:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:08,686 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:59:08,689 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:59:08,705 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:59:08,706 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 17:59:08,706 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:08,714 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:08,714 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:08,714 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 17:59:08,733 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 17:59:08,733 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 17:59:08,734 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:08,736 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:08,736 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:08,736 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 17:59:08,740 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:59:08,740 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:08,742 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:08,742 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:08,742 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:59:08,751 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:59:08,751 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:59:08,781 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:59:08,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274892323] [2019-12-07 17:59:08,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:59:08,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:59:08,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593574178] [2019-12-07 17:59:08,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:59:08,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:59:08,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:59:08,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:59:08,783 INFO L87 Difference]: Start difference. First operand 175 states and 271 transitions. Second operand 6 states. [2019-12-07 17:59:12,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:59:12,720 INFO L93 Difference]: Finished difference Result 445 states and 683 transitions. [2019-12-07 17:59:12,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:59:12,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-07 17:59:12,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:59:12,723 INFO L225 Difference]: With dead ends: 445 [2019-12-07 17:59:12,723 INFO L226 Difference]: Without dead ends: 289 [2019-12-07 17:59:12,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:59:12,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-12-07 17:59:12,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 176. [2019-12-07 17:59:12,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-12-07 17:59:12,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 271 transitions. [2019-12-07 17:59:12,734 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 271 transitions. Word has length 55 [2019-12-07 17:59:12,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:59:12,734 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 271 transitions. [2019-12-07 17:59:12,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:59:12,734 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 271 transitions. [2019-12-07 17:59:12,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 17:59:12,736 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:12,736 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:59:12,937 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 17:59:12,938 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:12,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:12,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1549428566, now seen corresponding path program 1 times [2019-12-07 17:59:12,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:59:12,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445214521] [2019-12-07 17:59:12,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 17:59:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:13,054 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:59:13,056 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:59:13,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:59:13,060 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:13,062 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:13,063 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:13,063 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:59:13,072 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:59:13,072 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:13,073 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:13,074 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:13,074 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:59:13,083 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:59:13,083 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:59:13,103 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:59:13,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1445214521] [2019-12-07 17:59:13,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:59:13,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:59:13,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032575243] [2019-12-07 17:59:13,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:59:13,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:59:13,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:59:13,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:59:13,104 INFO L87 Difference]: Start difference. First operand 176 states and 271 transitions. Second operand 6 states. [2019-12-07 17:59:22,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:59:22,156 INFO L93 Difference]: Finished difference Result 551 states and 847 transitions. [2019-12-07 17:59:22,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:59:22,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-07 17:59:22,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:59:22,159 INFO L225 Difference]: With dead ends: 551 [2019-12-07 17:59:22,159 INFO L226 Difference]: Without dead ends: 394 [2019-12-07 17:59:22,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:59:22,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-12-07 17:59:22,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 216. [2019-12-07 17:59:22,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-12-07 17:59:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 342 transitions. [2019-12-07 17:59:22,168 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 342 transitions. Word has length 55 [2019-12-07 17:59:22,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:59:22,169 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 342 transitions. [2019-12-07 17:59:22,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:59:22,169 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 342 transitions. [2019-12-07 17:59:22,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:59:22,169 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:22,169 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:59:22,370 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 17:59:22,371 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:22,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:22,372 INFO L82 PathProgramCache]: Analyzing trace with hash 781112648, now seen corresponding path program 1 times [2019-12-07 17:59:22,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:59:22,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33515897] [2019-12-07 17:59:22,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 17:59:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:22,497 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:59:22,499 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:59:22,502 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:59:22,502 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:22,505 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:22,505 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:22,506 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:59:22,514 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:59:22,514 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:22,516 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:22,516 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:22,516 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:59:22,525 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:59:22,525 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:59:22,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:59:22,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33515897] [2019-12-07 17:59:22,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:59:22,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:59:22,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035120536] [2019-12-07 17:59:22,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:59:22,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:59:22,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:59:22,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:59:22,548 INFO L87 Difference]: Start difference. First operand 216 states and 342 transitions. Second operand 6 states. [2019-12-07 17:59:29,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:59:29,660 INFO L93 Difference]: Finished difference Result 607 states and 953 transitions. [2019-12-07 17:59:29,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:59:29,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-07 17:59:29,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:59:29,664 INFO L225 Difference]: With dead ends: 607 [2019-12-07 17:59:29,664 INFO L226 Difference]: Without dead ends: 410 [2019-12-07 17:59:29,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:59:29,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-12-07 17:59:29,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 239. [2019-12-07 17:59:29,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-12-07 17:59:29,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 387 transitions. [2019-12-07 17:59:29,673 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 387 transitions. Word has length 56 [2019-12-07 17:59:29,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:59:29,674 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 387 transitions. [2019-12-07 17:59:29,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:59:29,674 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 387 transitions. [2019-12-07 17:59:29,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 17:59:29,675 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:29,675 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:59:29,875 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 17:59:29,876 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:29,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:29,876 INFO L82 PathProgramCache]: Analyzing trace with hash 60882110, now seen corresponding path program 1 times [2019-12-07 17:59:29,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:59:29,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550809750] [2019-12-07 17:59:29,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 17:59:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:29,972 INFO L264 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:59:29,974 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:59:29,977 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:59:29,978 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:29,980 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:29,981 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:29,981 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:59:29,989 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:59:29,989 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:29,991 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:29,991 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:29,991 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:59:30,003 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:59:30,003 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:59:30,028 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:59:30,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [550809750] [2019-12-07 17:59:30,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:59:30,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:59:30,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906695515] [2019-12-07 17:59:30,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:59:30,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:59:30,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:59:30,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:59:30,030 INFO L87 Difference]: Start difference. First operand 239 states and 387 transitions. Second operand 6 states. [2019-12-07 17:59:38,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:59:38,030 INFO L93 Difference]: Finished difference Result 703 states and 1130 transitions. [2019-12-07 17:59:38,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:59:38,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-12-07 17:59:38,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:59:38,033 INFO L225 Difference]: With dead ends: 703 [2019-12-07 17:59:38,033 INFO L226 Difference]: Without dead ends: 483 [2019-12-07 17:59:38,033 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:59:38,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-12-07 17:59:38,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 303. [2019-12-07 17:59:38,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-12-07 17:59:38,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 499 transitions. [2019-12-07 17:59:38,041 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 499 transitions. Word has length 84 [2019-12-07 17:59:38,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:59:38,041 INFO L462 AbstractCegarLoop]: Abstraction has 303 states and 499 transitions. [2019-12-07 17:59:38,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:59:38,041 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 499 transitions. [2019-12-07 17:59:38,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 17:59:38,042 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:38,042 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:59:38,243 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 17:59:38,243 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:38,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:38,243 INFO L82 PathProgramCache]: Analyzing trace with hash -626492070, now seen corresponding path program 1 times [2019-12-07 17:59:38,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:59:38,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257653323] [2019-12-07 17:59:38,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 17:59:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:38,343 INFO L264 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:59:38,345 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:59:38,348 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:59:38,349 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:38,352 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:38,352 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:38,352 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:59:38,361 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:59:38,362 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:38,363 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:38,363 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:38,364 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:59:38,377 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:59:38,377 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:59:38,408 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:59:38,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257653323] [2019-12-07 17:59:38,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:59:38,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:59:38,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497676512] [2019-12-07 17:59:38,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:59:38,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:59:38,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:59:38,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:59:38,409 INFO L87 Difference]: Start difference. First operand 303 states and 499 transitions. Second operand 6 states. [2019-12-07 17:59:44,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:59:44,001 INFO L93 Difference]: Finished difference Result 795 states and 1285 transitions. [2019-12-07 17:59:44,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:59:44,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-12-07 17:59:44,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:59:44,005 INFO L225 Difference]: With dead ends: 795 [2019-12-07 17:59:44,005 INFO L226 Difference]: Without dead ends: 511 [2019-12-07 17:59:44,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:59:44,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-12-07 17:59:44,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 340. [2019-12-07 17:59:44,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-07 17:59:44,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 563 transitions. [2019-12-07 17:59:44,014 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 563 transitions. Word has length 89 [2019-12-07 17:59:44,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:59:44,014 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 563 transitions. [2019-12-07 17:59:44,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:59:44,015 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 563 transitions. [2019-12-07 17:59:44,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 17:59:44,016 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:44,016 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:59:44,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 17:59:44,217 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:44,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:44,217 INFO L82 PathProgramCache]: Analyzing trace with hash -825947284, now seen corresponding path program 1 times [2019-12-07 17:59:44,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:59:44,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193068616] [2019-12-07 17:59:44,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 17:59:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:44,397 INFO L264 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:59:44,398 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:59:44,402 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:59:44,402 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:44,405 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:44,405 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:44,405 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:59:44,414 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:59:44,415 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:44,416 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:44,416 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:44,416 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:59:44,438 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:59:44,438 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:59:44,462 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:59:44,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193068616] [2019-12-07 17:59:44,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:59:44,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:59:44,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600274516] [2019-12-07 17:59:44,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:59:44,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:59:44,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:59:44,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:59:44,464 INFO L87 Difference]: Start difference. First operand 340 states and 563 transitions. Second operand 6 states. [2019-12-07 17:59:51,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:59:51,215 INFO L93 Difference]: Finished difference Result 827 states and 1340 transitions. [2019-12-07 17:59:51,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:59:51,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-12-07 17:59:51,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:59:51,217 INFO L225 Difference]: With dead ends: 827 [2019-12-07 17:59:51,217 INFO L226 Difference]: Without dead ends: 506 [2019-12-07 17:59:51,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:59:51,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-12-07 17:59:51,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 340. [2019-12-07 17:59:51,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-07 17:59:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 561 transitions. [2019-12-07 17:59:51,225 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 561 transitions. Word has length 90 [2019-12-07 17:59:51,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:59:51,225 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 561 transitions. [2019-12-07 17:59:51,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:59:51,225 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 561 transitions. [2019-12-07 17:59:51,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 17:59:51,226 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:51,226 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:59:51,426 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 17:59:51,427 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:51,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:51,428 INFO L82 PathProgramCache]: Analyzing trace with hash 839242534, now seen corresponding path program 1 times [2019-12-07 17:59:51,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:59:51,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764590463] [2019-12-07 17:59:51,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 17:59:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:51,665 INFO L264 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:59:51,667 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:59:51,683 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:59:51,684 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 17:59:51,684 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:51,692 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:51,692 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:51,692 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 17:59:51,710 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 17:59:51,710 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 17:59:51,711 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:51,713 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:51,714 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:51,714 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 17:59:51,717 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:59:51,717 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:51,718 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:51,719 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:51,719 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:59:51,728 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 17:59:51,729 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:59:51,762 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 17:59:51,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764590463] [2019-12-07 17:59:51,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:59:51,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:59:51,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395085288] [2019-12-07 17:59:51,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:59:51,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:59:51,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:59:51,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:59:51,763 INFO L87 Difference]: Start difference. First operand 340 states and 561 transitions. Second operand 6 states. [2019-12-07 17:59:56,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:59:56,190 INFO L93 Difference]: Finished difference Result 749 states and 1214 transitions. [2019-12-07 17:59:56,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:59:56,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-07 17:59:56,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:59:56,193 INFO L225 Difference]: With dead ends: 749 [2019-12-07 17:59:56,193 INFO L226 Difference]: Without dead ends: 428 [2019-12-07 17:59:56,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:59:56,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-12-07 17:59:56,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 340. [2019-12-07 17:59:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-07 17:59:56,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 554 transitions. [2019-12-07 17:59:56,200 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 554 transitions. Word has length 97 [2019-12-07 17:59:56,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:59:56,200 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 554 transitions. [2019-12-07 17:59:56,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:59:56,200 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 554 transitions. [2019-12-07 17:59:56,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 17:59:56,201 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:56,201 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:59:56,401 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 17:59:56,402 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:56,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:56,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1861579846, now seen corresponding path program 1 times [2019-12-07 17:59:56,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:59:56,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652678264] [2019-12-07 17:59:56,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 17:59:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:56,641 INFO L264 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:59:56,643 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:59:56,658 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:59:56,658 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 17:59:56,658 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:56,667 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:56,667 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:56,667 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 17:59:56,685 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 17:59:56,685 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 17:59:56,686 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:56,688 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:56,688 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:56,688 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 17:59:56,691 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:59:56,691 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:56,693 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:56,693 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:56,693 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:59:56,702 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 17:59:56,702 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:59:56,732 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 17:59:56,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652678264] [2019-12-07 17:59:56,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:59:56,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:59:56,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49673605] [2019-12-07 17:59:56,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:59:56,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:59:56,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:59:56,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:59:56,733 INFO L87 Difference]: Start difference. First operand 340 states and 554 transitions. Second operand 6 states. [2019-12-07 18:00:02,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:00:02,328 INFO L93 Difference]: Finished difference Result 749 states and 1201 transitions. [2019-12-07 18:00:02,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:00:02,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-07 18:00:02,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:00:02,330 INFO L225 Difference]: With dead ends: 749 [2019-12-07 18:00:02,330 INFO L226 Difference]: Without dead ends: 428 [2019-12-07 18:00:02,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:00:02,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-12-07 18:00:02,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 340. [2019-12-07 18:00:02,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-07 18:00:02,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 547 transitions. [2019-12-07 18:00:02,340 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 547 transitions. Word has length 97 [2019-12-07 18:00:02,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:00:02,340 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 547 transitions. [2019-12-07 18:00:02,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:00:02,340 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 547 transitions. [2019-12-07 18:00:02,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 18:00:02,341 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:00:02,341 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:00:02,542 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 18:00:02,542 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:00:02,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:00:02,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1206787165, now seen corresponding path program 1 times [2019-12-07 18:00:02,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:00:02,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43178764] [2019-12-07 18:00:02,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 18:00:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:02,751 INFO L264 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:00:02,753 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:00:02,771 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 18:00:02,771 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 18:00:02,771 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:02,779 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:02,779 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:02,779 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 18:00:02,797 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 18:00:02,797 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 18:00:02,797 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:02,799 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:02,800 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:02,800 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 18:00:02,802 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:00:02,803 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:02,804 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:02,804 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:02,804 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 18:00:02,820 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 18:00:02,821 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:00:02,848 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 18:00:02,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43178764] [2019-12-07 18:00:02,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:00:02,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:00:02,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38450568] [2019-12-07 18:00:02,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:00:02,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:00:02,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:00:02,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:00:02,849 INFO L87 Difference]: Start difference. First operand 340 states and 547 transitions. Second operand 6 states. [2019-12-07 18:00:08,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:00:08,121 INFO L93 Difference]: Finished difference Result 749 states and 1188 transitions. [2019-12-07 18:00:08,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:00:08,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-12-07 18:00:08,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:00:08,123 INFO L225 Difference]: With dead ends: 749 [2019-12-07 18:00:08,123 INFO L226 Difference]: Without dead ends: 428 [2019-12-07 18:00:08,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:00:08,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-12-07 18:00:08,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 340. [2019-12-07 18:00:08,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-07 18:00:08,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 540 transitions. [2019-12-07 18:00:08,131 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 540 transitions. Word has length 98 [2019-12-07 18:00:08,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:00:08,131 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 540 transitions. [2019-12-07 18:00:08,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:00:08,132 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 540 transitions. [2019-12-07 18:00:08,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 18:00:08,133 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:00:08,133 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:00:08,333 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 18:00:08,334 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:00:08,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:00:08,334 INFO L82 PathProgramCache]: Analyzing trace with hash -541945670, now seen corresponding path program 1 times [2019-12-07 18:00:08,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:00:08,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091180283] [2019-12-07 18:00:08,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 18:00:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:08,476 INFO L264 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:00:08,478 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:00:08,481 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:00:08,481 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:08,483 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:08,483 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:08,483 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:00:08,490 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:00:08,490 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:08,492 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:08,492 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:08,492 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:00:08,506 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:00:08,506 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:00:08,532 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:00:08,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091180283] [2019-12-07 18:00:08,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:00:08,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:00:08,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997065031] [2019-12-07 18:00:08,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:00:08,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:00:08,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:00:08,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:00:08,533 INFO L87 Difference]: Start difference. First operand 340 states and 540 transitions. Second operand 6 states. [2019-12-07 18:00:16,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:00:16,742 INFO L93 Difference]: Finished difference Result 865 states and 1356 transitions. [2019-12-07 18:00:16,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:00:16,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-12-07 18:00:16,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:00:16,745 INFO L225 Difference]: With dead ends: 865 [2019-12-07 18:00:16,745 INFO L226 Difference]: Without dead ends: 544 [2019-12-07 18:00:16,745 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:00:16,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-12-07 18:00:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 383. [2019-12-07 18:00:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-12-07 18:00:16,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 610 transitions. [2019-12-07 18:00:16,755 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 610 transitions. Word has length 98 [2019-12-07 18:00:16,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:00:16,755 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 610 transitions. [2019-12-07 18:00:16,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:00:16,755 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 610 transitions. [2019-12-07 18:00:16,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 18:00:16,756 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:00:16,756 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:00:16,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 18:00:16,957 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:00:16,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:00:16,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1776290209, now seen corresponding path program 1 times [2019-12-07 18:00:16,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:00:16,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534395222] [2019-12-07 18:00:16,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 18:00:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:17,239 INFO L264 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:00:17,241 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:00:17,255 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 18:00:17,256 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 18:00:17,256 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:17,264 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:17,264 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:17,264 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 18:00:17,283 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 18:00:17,283 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 18:00:17,283 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:17,285 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:17,286 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:17,286 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 18:00:17,288 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:00:17,289 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:17,290 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:17,290 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:17,290 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 18:00:17,301 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 18:00:17,301 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:00:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 18:00:17,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534395222] [2019-12-07 18:00:17,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:00:17,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:00:17,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731497470] [2019-12-07 18:00:17,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:00:17,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:00:17,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:00:17,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:00:17,332 INFO L87 Difference]: Start difference. First operand 383 states and 610 transitions. Second operand 6 states. [2019-12-07 18:00:21,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:00:21,860 INFO L93 Difference]: Finished difference Result 835 states and 1315 transitions. [2019-12-07 18:00:21,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:00:21,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-12-07 18:00:21,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:00:21,862 INFO L225 Difference]: With dead ends: 835 [2019-12-07 18:00:21,862 INFO L226 Difference]: Without dead ends: 471 [2019-12-07 18:00:21,863 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:00:21,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-12-07 18:00:21,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 383. [2019-12-07 18:00:21,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-12-07 18:00:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 602 transitions. [2019-12-07 18:00:21,870 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 602 transitions. Word has length 99 [2019-12-07 18:00:21,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:00:21,870 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 602 transitions. [2019-12-07 18:00:21,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:00:21,870 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 602 transitions. [2019-12-07 18:00:21,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 18:00:21,871 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:00:21,871 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:00:22,071 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 18:00:22,072 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:00:22,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:00:22,072 INFO L82 PathProgramCache]: Analyzing trace with hash 246835400, now seen corresponding path program 1 times [2019-12-07 18:00:22,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:00:22,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [852056386] [2019-12-07 18:00:22,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 18:00:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:22,213 INFO L264 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:00:22,215 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:00:22,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:00:22,218 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:22,220 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:22,220 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:22,221 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:00:22,228 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:00:22,228 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:22,230 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:22,230 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:22,230 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:00:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:00:22,253 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:00:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:00:22,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [852056386] [2019-12-07 18:00:22,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:00:22,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:00:22,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383511479] [2019-12-07 18:00:22,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:00:22,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:00:22,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:00:22,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:00:22,282 INFO L87 Difference]: Start difference. First operand 383 states and 602 transitions. Second operand 6 states. [2019-12-07 18:00:31,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:00:31,256 INFO L93 Difference]: Finished difference Result 907 states and 1408 transitions. [2019-12-07 18:00:31,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:00:31,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-12-07 18:00:31,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:00:31,259 INFO L225 Difference]: With dead ends: 907 [2019-12-07 18:00:31,259 INFO L226 Difference]: Without dead ends: 539 [2019-12-07 18:00:31,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:00:31,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-12-07 18:00:31,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 385. [2019-12-07 18:00:31,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-12-07 18:00:31,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 605 transitions. [2019-12-07 18:00:31,267 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 605 transitions. Word has length 99 [2019-12-07 18:00:31,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:00:31,267 INFO L462 AbstractCegarLoop]: Abstraction has 385 states and 605 transitions. [2019-12-07 18:00:31,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:00:31,267 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 605 transitions. [2019-12-07 18:00:31,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 18:00:31,268 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:00:31,268 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:00:31,468 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 18:00:31,469 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:00:31,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:00:31,470 INFO L82 PathProgramCache]: Analyzing trace with hash 919384802, now seen corresponding path program 1 times [2019-12-07 18:00:31,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:00:31,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [898594238] [2019-12-07 18:00:31,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 18:00:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:31,784 INFO L264 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:00:31,786 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:00:31,804 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 18:00:31,804 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 18:00:31,805 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:31,813 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:31,813 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:31,813 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 18:00:31,835 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 18:00:31,835 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 18:00:31,835 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:31,837 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:31,838 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:31,838 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 18:00:31,841 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:00:31,841 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:31,843 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:31,843 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:31,843 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 18:00:31,853 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 18:00:31,853 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:00:31,883 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 18:00:31,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [898594238] [2019-12-07 18:00:31,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:00:31,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:00:31,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105493482] [2019-12-07 18:00:31,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:00:31,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:00:31,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:00:31,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:00:31,885 INFO L87 Difference]: Start difference. First operand 385 states and 605 transitions. Second operand 6 states. [2019-12-07 18:00:38,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:00:38,951 INFO L93 Difference]: Finished difference Result 815 states and 1273 transitions. [2019-12-07 18:00:38,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:00:38,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-12-07 18:00:38,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:00:38,954 INFO L225 Difference]: With dead ends: 815 [2019-12-07 18:00:38,954 INFO L226 Difference]: Without dead ends: 449 [2019-12-07 18:00:38,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:00:38,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-12-07 18:00:38,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 385. [2019-12-07 18:00:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-12-07 18:00:38,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 597 transitions. [2019-12-07 18:00:38,964 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 597 transitions. Word has length 100 [2019-12-07 18:00:38,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:00:38,964 INFO L462 AbstractCegarLoop]: Abstraction has 385 states and 597 transitions. [2019-12-07 18:00:38,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:00:38,965 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 597 transitions. [2019-12-07 18:00:38,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-07 18:00:38,966 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:00:38,966 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:00:39,166 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 18:00:39,167 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:00:39,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:00:39,168 INFO L82 PathProgramCache]: Analyzing trace with hash -2031824588, now seen corresponding path program 1 times [2019-12-07 18:00:39,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:00:39,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314215052] [2019-12-07 18:00:39,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 18:00:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:39,315 INFO L264 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:00:39,316 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:00:39,320 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:00:39,320 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:39,322 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:39,322 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:39,323 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:00:39,329 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:00:39,329 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:39,331 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:39,331 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:39,331 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:00:39,345 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 18:00:39,345 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:00:39,370 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 18:00:39,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314215052] [2019-12-07 18:00:39,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:00:39,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:00:39,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810794797] [2019-12-07 18:00:39,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:00:39,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:00:39,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:00:39,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:00:39,371 INFO L87 Difference]: Start difference. First operand 385 states and 597 transitions. Second operand 6 states. [2019-12-07 18:00:44,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:00:44,843 INFO L93 Difference]: Finished difference Result 927 states and 1428 transitions. [2019-12-07 18:00:44,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:00:44,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2019-12-07 18:00:44,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:00:44,846 INFO L225 Difference]: With dead ends: 927 [2019-12-07 18:00:44,846 INFO L226 Difference]: Without dead ends: 561 [2019-12-07 18:00:44,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:00:44,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-12-07 18:00:44,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 415. [2019-12-07 18:00:44,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-12-07 18:00:44,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 639 transitions. [2019-12-07 18:00:44,854 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 639 transitions. Word has length 111 [2019-12-07 18:00:44,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:00:44,854 INFO L462 AbstractCegarLoop]: Abstraction has 415 states and 639 transitions. [2019-12-07 18:00:44,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:00:44,854 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 639 transitions. [2019-12-07 18:00:44,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 18:00:44,855 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:00:44,855 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:00:45,055 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 18:00:45,056 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:00:45,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:00:45,057 INFO L82 PathProgramCache]: Analyzing trace with hash -386107957, now seen corresponding path program 1 times [2019-12-07 18:00:45,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:00:45,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363976437] [2019-12-07 18:00:45,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 18:00:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:45,219 INFO L264 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:00:45,221 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:00:45,224 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:00:45,224 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:45,226 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:45,226 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:45,227 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:00:45,234 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:00:45,234 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:45,235 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:45,236 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:45,236 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:00:45,250 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 18:00:45,250 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:00:45,274 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 18:00:45,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [363976437] [2019-12-07 18:00:45,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:00:45,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:00:45,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835384582] [2019-12-07 18:00:45,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:00:45,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:00:45,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:00:45,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:00:45,276 INFO L87 Difference]: Start difference. First operand 415 states and 639 transitions. Second operand 6 states. [2019-12-07 18:00:50,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:00:50,489 INFO L93 Difference]: Finished difference Result 943 states and 1443 transitions. [2019-12-07 18:00:50,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:00:50,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2019-12-07 18:00:50,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:00:50,492 INFO L225 Difference]: With dead ends: 943 [2019-12-07 18:00:50,492 INFO L226 Difference]: Without dead ends: 547 [2019-12-07 18:00:50,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:00:50,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-12-07 18:00:50,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 415. [2019-12-07 18:00:50,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-12-07 18:00:50,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 633 transitions. [2019-12-07 18:00:50,500 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 633 transitions. Word has length 112 [2019-12-07 18:00:50,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:00:50,500 INFO L462 AbstractCegarLoop]: Abstraction has 415 states and 633 transitions. [2019-12-07 18:00:50,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:00:50,500 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 633 transitions. [2019-12-07 18:00:50,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-07 18:00:50,501 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:00:50,501 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:00:50,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 18:00:50,702 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:00:50,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:00:50,703 INFO L82 PathProgramCache]: Analyzing trace with hash -941757422, now seen corresponding path program 1 times [2019-12-07 18:00:50,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:00:50,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7507210] [2019-12-07 18:00:50,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 18:00:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:50,892 INFO L264 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:00:50,894 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:00:50,897 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:00:50,898 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:50,900 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:50,900 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:50,900 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:00:50,909 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:00:50,909 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:50,911 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:50,911 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:50,911 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:00:50,925 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 18:00:50,925 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:00:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 18:00:50,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7507210] [2019-12-07 18:00:50,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:00:50,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:00:50,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327019793] [2019-12-07 18:00:50,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:00:50,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:00:50,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:00:50,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:00:50,951 INFO L87 Difference]: Start difference. First operand 415 states and 633 transitions. Second operand 6 states. [2019-12-07 18:00:57,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:00:57,864 INFO L93 Difference]: Finished difference Result 985 states and 1494 transitions. [2019-12-07 18:00:57,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:00:57,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-12-07 18:00:57,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:00:57,867 INFO L225 Difference]: With dead ends: 985 [2019-12-07 18:00:57,868 INFO L226 Difference]: Without dead ends: 589 [2019-12-07 18:00:57,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:00:57,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-12-07 18:00:57,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 443. [2019-12-07 18:00:57,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-12-07 18:00:57,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 670 transitions. [2019-12-07 18:00:57,878 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 670 transitions. Word has length 114 [2019-12-07 18:00:57,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:00:57,879 INFO L462 AbstractCegarLoop]: Abstraction has 443 states and 670 transitions. [2019-12-07 18:00:57,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:00:57,879 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 670 transitions. [2019-12-07 18:00:57,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 18:00:57,880 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:00:57,880 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:00:58,080 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 18:00:58,081 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:00:58,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:00:58,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1988583611, now seen corresponding path program 1 times [2019-12-07 18:00:58,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:00:58,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374844881] [2019-12-07 18:00:58,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 18:00:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:58,254 INFO L264 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:00:58,255 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:00:58,258 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:00:58,258 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:58,261 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:58,261 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:58,261 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:00:58,268 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:00:58,268 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:58,270 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:58,270 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:58,270 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:00:58,285 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 18:00:58,285 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:00:58,310 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 18:00:58,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374844881] [2019-12-07 18:00:58,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:00:58,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:00:58,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836216734] [2019-12-07 18:00:58,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:00:58,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:00:58,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:00:58,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:00:58,311 INFO L87 Difference]: Start difference. First operand 443 states and 670 transitions. Second operand 6 states. [2019-12-07 18:01:05,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:05,836 INFO L93 Difference]: Finished difference Result 991 states and 1490 transitions. [2019-12-07 18:01:05,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:01:05,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-12-07 18:01:05,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:05,839 INFO L225 Difference]: With dead ends: 991 [2019-12-07 18:01:05,839 INFO L226 Difference]: Without dead ends: 567 [2019-12-07 18:01:05,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:01:05,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-12-07 18:01:05,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 443. [2019-12-07 18:01:05,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-12-07 18:01:05,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 663 transitions. [2019-12-07 18:01:05,847 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 663 transitions. Word has length 115 [2019-12-07 18:01:05,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:05,847 INFO L462 AbstractCegarLoop]: Abstraction has 443 states and 663 transitions. [2019-12-07 18:01:05,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:01:05,847 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 663 transitions. [2019-12-07 18:01:05,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 18:01:05,848 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:05,848 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:01:06,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 18:01:06,049 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:06,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:06,050 INFO L82 PathProgramCache]: Analyzing trace with hash -538338461, now seen corresponding path program 1 times [2019-12-07 18:01:06,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:01:06,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237274995] [2019-12-07 18:01:06,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-12-07 18:01:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:06,194 INFO L264 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:01:06,195 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:01:06,199 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:01:06,199 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:06,201 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:06,202 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:01:06,202 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:01:06,209 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:01:06,209 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:06,210 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:06,211 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:01:06,211 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:01:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 18:01:06,226 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:01:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 18:01:06,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1237274995] [2019-12-07 18:01:06,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:06,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:01:06,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814845269] [2019-12-07 18:01:06,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:01:06,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:01:06,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:01:06,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:01:06,255 INFO L87 Difference]: Start difference. First operand 443 states and 663 transitions. Second operand 6 states. [2019-12-07 18:01:14,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:14,527 INFO L93 Difference]: Finished difference Result 1033 states and 1537 transitions. [2019-12-07 18:01:14,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:01:14,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-12-07 18:01:14,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:14,529 INFO L225 Difference]: With dead ends: 1033 [2019-12-07 18:01:14,530 INFO L226 Difference]: Without dead ends: 609 [2019-12-07 18:01:14,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:01:14,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-07 18:01:14,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 478. [2019-12-07 18:01:14,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-12-07 18:01:14,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 712 transitions. [2019-12-07 18:01:14,538 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 712 transitions. Word has length 121 [2019-12-07 18:01:14,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:14,538 INFO L462 AbstractCegarLoop]: Abstraction has 478 states and 712 transitions. [2019-12-07 18:01:14,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:01:14,539 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 712 transitions. [2019-12-07 18:01:14,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-07 18:01:14,539 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:14,539 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:01:14,740 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-12-07 18:01:14,740 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:14,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:14,741 INFO L82 PathProgramCache]: Analyzing trace with hash 2026395157, now seen corresponding path program 1 times [2019-12-07 18:01:14,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:01:14,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504101946] [2019-12-07 18:01:14,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-12-07 18:01:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:14,961 INFO L264 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:01:14,962 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:01:14,966 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:01:14,967 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:14,969 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:14,969 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:01:14,969 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:01:14,975 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:01:14,975 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:14,976 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:14,977 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:01:14,977 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:01:14,993 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 18:01:14,993 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:01:15,020 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 18:01:15,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504101946] [2019-12-07 18:01:15,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:15,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:01:15,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369246986] [2019-12-07 18:01:15,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:01:15,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:01:15,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:01:15,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:01:15,021 INFO L87 Difference]: Start difference. First operand 478 states and 712 transitions. Second operand 6 states. [2019-12-07 18:01:19,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:19,980 INFO L93 Difference]: Finished difference Result 1059 states and 1570 transitions. [2019-12-07 18:01:19,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:01:19,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-12-07 18:01:19,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:19,983 INFO L225 Difference]: With dead ends: 1059 [2019-12-07 18:01:19,983 INFO L226 Difference]: Without dead ends: 600 [2019-12-07 18:01:19,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:01:19,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-12-07 18:01:19,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 478. [2019-12-07 18:01:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-12-07 18:01:19,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 708 transitions. [2019-12-07 18:01:19,996 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 708 transitions. Word has length 122 [2019-12-07 18:01:19,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:19,996 INFO L462 AbstractCegarLoop]: Abstraction has 478 states and 708 transitions. [2019-12-07 18:01:19,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:01:19,997 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 708 transitions. [2019-12-07 18:01:19,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-12-07 18:01:19,998 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:19,998 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:01:20,198 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-12-07 18:01:20,199 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:20,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:20,199 INFO L82 PathProgramCache]: Analyzing trace with hash 297188694, now seen corresponding path program 1 times [2019-12-07 18:01:20,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:01:20,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367580623] [2019-12-07 18:01:20,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-12-07 18:01:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:20,403 INFO L264 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:01:20,405 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:01:20,408 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:01:20,408 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:20,411 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:20,412 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:01:20,412 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:01:20,420 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:01:20,420 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:20,422 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:20,422 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:01:20,422 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:01:20,443 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 18:01:20,443 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:01:20,483 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 18:01:20,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367580623] [2019-12-07 18:01:20,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:20,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:01:20,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674388997] [2019-12-07 18:01:20,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:01:20,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:01:20,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:01:20,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:01:20,484 INFO L87 Difference]: Start difference. First operand 478 states and 708 transitions. Second operand 6 states. [2019-12-07 18:01:28,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:28,664 INFO L93 Difference]: Finished difference Result 1102 states and 1622 transitions. [2019-12-07 18:01:28,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:01:28,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2019-12-07 18:01:28,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:28,667 INFO L225 Difference]: With dead ends: 1102 [2019-12-07 18:01:28,667 INFO L226 Difference]: Without dead ends: 643 [2019-12-07 18:01:28,668 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:01:28,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-12-07 18:01:28,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 521. [2019-12-07 18:01:28,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2019-12-07 18:01:28,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 767 transitions. [2019-12-07 18:01:28,677 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 767 transitions. Word has length 139 [2019-12-07 18:01:28,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:28,677 INFO L462 AbstractCegarLoop]: Abstraction has 521 states and 767 transitions. [2019-12-07 18:01:28,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:01:28,677 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 767 transitions. [2019-12-07 18:01:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-12-07 18:01:28,678 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:28,678 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:01:28,878 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-12-07 18:01:28,879 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:28,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:28,880 INFO L82 PathProgramCache]: Analyzing trace with hash 785633704, now seen corresponding path program 1 times [2019-12-07 18:01:28,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:01:28,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129061813] [2019-12-07 18:01:28,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-12-07 18:01:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:29,048 INFO L264 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:01:29,049 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:01:29,053 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:01:29,053 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:29,056 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:29,056 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:01:29,056 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:01:29,064 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:01:29,064 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:29,066 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:29,066 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:01:29,066 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:01:29,086 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 18:01:29,086 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:01:29,118 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 18:01:29,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129061813] [2019-12-07 18:01:29,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:29,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:01:29,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214633762] [2019-12-07 18:01:29,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:01:29,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:01:29,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:01:29,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:01:29,119 INFO L87 Difference]: Start difference. First operand 521 states and 767 transitions. Second operand 6 states. [2019-12-07 18:01:38,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:38,128 INFO L93 Difference]: Finished difference Result 1143 states and 1676 transitions. [2019-12-07 18:01:38,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:01:38,129 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-12-07 18:01:38,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:38,132 INFO L225 Difference]: With dead ends: 1143 [2019-12-07 18:01:38,132 INFO L226 Difference]: Without dead ends: 625 [2019-12-07 18:01:38,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:01:38,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-12-07 18:01:38,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 513. [2019-12-07 18:01:38,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2019-12-07 18:01:38,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 753 transitions. [2019-12-07 18:01:38,142 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 753 transitions. Word has length 140 [2019-12-07 18:01:38,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:38,142 INFO L462 AbstractCegarLoop]: Abstraction has 513 states and 753 transitions. [2019-12-07 18:01:38,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:01:38,142 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 753 transitions. [2019-12-07 18:01:38,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-12-07 18:01:38,143 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:38,143 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:01:38,343 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-12-07 18:01:38,344 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:38,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:38,345 INFO L82 PathProgramCache]: Analyzing trace with hash 713545668, now seen corresponding path program 1 times [2019-12-07 18:01:38,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:01:38,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735453937] [2019-12-07 18:01:38,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2019-12-07 18:01:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:38,512 INFO L264 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:01:38,514 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:01:38,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:01:38,517 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:38,519 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:38,519 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:01:38,519 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:01:38,525 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:01:38,525 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:38,526 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:38,527 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:01:38,527 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:01:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 18:01:38,551 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:01:38,580 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 18:01:38,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735453937] [2019-12-07 18:01:38,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:38,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:01:38,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533850957] [2019-12-07 18:01:38,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:01:38,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:01:38,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:01:38,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:01:38,581 INFO L87 Difference]: Start difference. First operand 513 states and 753 transitions. Second operand 6 states. [2019-12-07 18:01:42,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:42,875 INFO L93 Difference]: Finished difference Result 1153 states and 1689 transitions. [2019-12-07 18:01:42,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:01:42,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-12-07 18:01:42,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:42,878 INFO L225 Difference]: With dead ends: 1153 [2019-12-07 18:01:42,878 INFO L226 Difference]: Without dead ends: 659 [2019-12-07 18:01:42,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:01:42,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-12-07 18:01:42,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 539. [2019-12-07 18:01:42,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-12-07 18:01:42,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 783 transitions. [2019-12-07 18:01:42,889 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 783 transitions. Word has length 142 [2019-12-07 18:01:42,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:42,889 INFO L462 AbstractCegarLoop]: Abstraction has 539 states and 783 transitions. [2019-12-07 18:01:42,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:01:42,889 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 783 transitions. [2019-12-07 18:01:42,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-07 18:01:42,890 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:42,890 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:01:43,090 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2019-12-07 18:01:43,091 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:43,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:43,092 INFO L82 PathProgramCache]: Analyzing trace with hash -266190451, now seen corresponding path program 1 times [2019-12-07 18:01:43,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:01:43,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667106897] [2019-12-07 18:01:43,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2019-12-07 18:01:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:43,297 INFO L264 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:01:43,299 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:01:43,302 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:01:43,302 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:43,305 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:43,305 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:01:43,305 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:01:43,313 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:01:43,313 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:43,315 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:43,315 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:01:43,315 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:01:43,338 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 18:01:43,338 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:01:43,366 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 18:01:43,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667106897] [2019-12-07 18:01:43,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:43,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:01:43,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196248128] [2019-12-07 18:01:43,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:01:43,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:01:43,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:01:43,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:01:43,367 INFO L87 Difference]: Start difference. First operand 539 states and 783 transitions. Second operand 6 states. [2019-12-07 18:01:49,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:49,255 INFO L93 Difference]: Finished difference Result 1169 states and 1695 transitions. [2019-12-07 18:01:49,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:01:49,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-12-07 18:01:49,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:49,258 INFO L225 Difference]: With dead ends: 1169 [2019-12-07 18:01:49,258 INFO L226 Difference]: Without dead ends: 649 [2019-12-07 18:01:49,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:01:49,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-12-07 18:01:49,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 539. [2019-12-07 18:01:49,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-12-07 18:01:49,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 773 transitions. [2019-12-07 18:01:49,268 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 773 transitions. Word has length 143 [2019-12-07 18:01:49,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:49,269 INFO L462 AbstractCegarLoop]: Abstraction has 539 states and 773 transitions. [2019-12-07 18:01:49,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:01:49,269 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 773 transitions. [2019-12-07 18:01:49,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-12-07 18:01:49,269 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:49,270 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 18:01:49,470 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2019-12-07 18:01:49,471 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:49,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:49,472 INFO L82 PathProgramCache]: Analyzing trace with hash 333012812, now seen corresponding path program 1 times [2019-12-07 18:01:49,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:01:49,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856313730] [2019-12-07 18:01:49,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2019-12-07 18:01:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:49,617 INFO L264 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:01:49,619 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:01:49,621 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:01:49,622 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:49,624 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:49,625 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:01:49,625 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:01:49,632 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:01:49,632 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:49,633 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:49,633 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:01:49,634 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:01:49,658 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 18:01:49,658 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:01:49,700 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 18:01:49,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856313730] [2019-12-07 18:01:49,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:49,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:01:49,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7305344] [2019-12-07 18:01:49,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:01:49,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:01:49,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:01:49,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:01:49,701 INFO L87 Difference]: Start difference. First operand 539 states and 773 transitions. Second operand 6 states. [2019-12-07 18:01:55,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:55,150 INFO L93 Difference]: Finished difference Result 1203 states and 1723 transitions. [2019-12-07 18:01:55,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:01:55,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-12-07 18:01:55,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:55,152 INFO L225 Difference]: With dead ends: 1203 [2019-12-07 18:01:55,152 INFO L226 Difference]: Without dead ends: 683 [2019-12-07 18:01:55,153 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:01:55,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-12-07 18:01:55,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 572. [2019-12-07 18:01:55,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-12-07 18:01:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 815 transitions. [2019-12-07 18:01:55,163 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 815 transitions. Word has length 153 [2019-12-07 18:01:55,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:55,164 INFO L462 AbstractCegarLoop]: Abstraction has 572 states and 815 transitions. [2019-12-07 18:01:55,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:01:55,164 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 815 transitions. [2019-12-07 18:01:55,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-07 18:01:55,164 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:55,165 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:01:55,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-12-07 18:01:55,365 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:55,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:55,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1889886562, now seen corresponding path program 1 times [2019-12-07 18:01:55,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:01:55,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952763188] [2019-12-07 18:01:55,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2019-12-07 18:01:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:55,570 INFO L264 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:01:55,572 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:01:55,575 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:01:55,575 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:55,578 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:55,578 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:01:55,578 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:01:55,590 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:01:55,590 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:55,592 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:55,592 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:01:55,592 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:01:55,613 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 18:01:55,613 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:01:55,649 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 18:01:55,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952763188] [2019-12-07 18:01:55,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:55,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:01:55,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866298120] [2019-12-07 18:01:55,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:01:55,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:01:55,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:01:55,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:01:55,650 INFO L87 Difference]: Start difference. First operand 572 states and 815 transitions. Second operand 6 states. [2019-12-07 18:02:03,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:02:03,235 INFO L93 Difference]: Finished difference Result 1231 states and 1752 transitions. [2019-12-07 18:02:03,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:02:03,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2019-12-07 18:02:03,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:02:03,240 INFO L225 Difference]: With dead ends: 1231 [2019-12-07 18:02:03,240 INFO L226 Difference]: Without dead ends: 660 [2019-12-07 18:02:03,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:02:03,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-12-07 18:02:03,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 563. [2019-12-07 18:02:03,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-12-07 18:02:03,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 795 transitions. [2019-12-07 18:02:03,252 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 795 transitions. Word has length 154 [2019-12-07 18:02:03,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:02:03,252 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 795 transitions. [2019-12-07 18:02:03,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:02:03,252 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 795 transitions. [2019-12-07 18:02:03,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-12-07 18:02:03,253 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:02:03,253 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:02:03,453 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2019-12-07 18:02:03,454 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:02:03,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:03,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1254627333, now seen corresponding path program 1 times [2019-12-07 18:02:03,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:02:03,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933518627] [2019-12-07 18:02:03,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2019-12-07 18:02:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:03,630 INFO L264 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:02:03,632 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:02:03,635 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:02:03,635 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:03,638 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:03,638 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:03,638 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:02:03,645 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:02:03,646 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:03,647 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:03,647 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:03,647 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:02:03,682 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 18:02:03,682 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:02:03,713 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 18:02:03,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933518627] [2019-12-07 18:02:03,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:02:03,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:02:03,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514866748] [2019-12-07 18:02:03,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:02:03,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:02:03,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:02:03,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:02:03,715 INFO L87 Difference]: Start difference. First operand 563 states and 795 transitions. Second operand 6 states. [2019-12-07 18:02:10,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:02:10,805 INFO L93 Difference]: Finished difference Result 1229 states and 1739 transitions. [2019-12-07 18:02:10,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:02:10,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-12-07 18:02:10,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:02:10,810 INFO L225 Difference]: With dead ends: 1229 [2019-12-07 18:02:10,810 INFO L226 Difference]: Without dead ends: 685 [2019-12-07 18:02:10,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:02:10,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-12-07 18:02:10,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 585. [2019-12-07 18:02:10,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-12-07 18:02:10,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 815 transitions. [2019-12-07 18:02:10,822 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 815 transitions. Word has length 161 [2019-12-07 18:02:10,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:02:10,822 INFO L462 AbstractCegarLoop]: Abstraction has 585 states and 815 transitions. [2019-12-07 18:02:10,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:02:10,822 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 815 transitions. [2019-12-07 18:02:10,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-07 18:02:10,823 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:02:10,823 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:02:11,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 mathsat -unsat_core_generation=3 [2019-12-07 18:02:11,025 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:02:11,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:11,025 INFO L82 PathProgramCache]: Analyzing trace with hash 539092562, now seen corresponding path program 1 times [2019-12-07 18:02:11,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:02:11,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512885281] [2019-12-07 18:02:11,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 31 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with mathsat -unsat_core_generation=3 [2019-12-07 18:02:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:11,195 INFO L264 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:02:11,196 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:02:11,199 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:02:11,200 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:11,202 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:11,202 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:11,202 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:02:11,208 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:02:11,209 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:11,210 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:11,210 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:11,210 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:02:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 18:02:11,230 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:02:11,262 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 18:02:11,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512885281] [2019-12-07 18:02:11,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:02:11,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:02:11,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839191366] [2019-12-07 18:02:11,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:02:11,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:02:11,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:02:11,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:02:11,263 INFO L87 Difference]: Start difference. First operand 585 states and 815 transitions. Second operand 6 states. [2019-12-07 18:02:19,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:02:19,218 INFO L93 Difference]: Finished difference Result 1244 states and 1735 transitions. [2019-12-07 18:02:19,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:02:19,220 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2019-12-07 18:02:19,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:02:19,222 INFO L225 Difference]: With dead ends: 1244 [2019-12-07 18:02:19,222 INFO L226 Difference]: Without dead ends: 678 [2019-12-07 18:02:19,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:02:19,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-12-07 18:02:19,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 585. [2019-12-07 18:02:19,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-12-07 18:02:19,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 803 transitions. [2019-12-07 18:02:19,234 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 803 transitions. Word has length 162 [2019-12-07 18:02:19,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:02:19,234 INFO L462 AbstractCegarLoop]: Abstraction has 585 states and 803 transitions. [2019-12-07 18:02:19,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:02:19,234 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 803 transitions. [2019-12-07 18:02:19,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-07 18:02:19,235 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:02:19,235 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:02:19,435 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 mathsat -unsat_core_generation=3 [2019-12-07 18:02:19,436 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:02:19,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:19,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1607603189, now seen corresponding path program 1 times [2019-12-07 18:02:19,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:02:19,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376590719] [2019-12-07 18:02:19,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2019-12-07 18:02:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:19,683 INFO L264 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:02:19,685 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:02:19,688 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:02:19,688 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:19,691 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:19,691 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:19,691 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:02:19,697 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:02:19,697 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:19,698 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:19,698 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:19,699 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:02:19,726 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 18:02:19,726 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:02:19,761 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 18:02:19,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376590719] [2019-12-07 18:02:19,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:02:19,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:02:19,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705249792] [2019-12-07 18:02:19,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:02:19,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:02:19,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:02:19,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:02:19,762 INFO L87 Difference]: Start difference. First operand 585 states and 803 transitions. Second operand 6 states. [2019-12-07 18:02:26,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:02:26,883 INFO L93 Difference]: Finished difference Result 1269 states and 1745 transitions. [2019-12-07 18:02:26,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:02:26,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2019-12-07 18:02:26,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:02:26,887 INFO L225 Difference]: With dead ends: 1269 [2019-12-07 18:02:26,887 INFO L226 Difference]: Without dead ends: 703 [2019-12-07 18:02:26,888 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:02:26,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-12-07 18:02:26,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 609. [2019-12-07 18:02:26,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2019-12-07 18:02:26,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 825 transitions. [2019-12-07 18:02:26,900 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 825 transitions. Word has length 164 [2019-12-07 18:02:26,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:02:26,900 INFO L462 AbstractCegarLoop]: Abstraction has 609 states and 825 transitions. [2019-12-07 18:02:26,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:02:26,900 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 825 transitions. [2019-12-07 18:02:26,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-07 18:02:26,901 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:02:26,901 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:02:27,101 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3 [2019-12-07 18:02:27,102 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:02:27,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:27,103 INFO L82 PathProgramCache]: Analyzing trace with hash -2130185036, now seen corresponding path program 1 times [2019-12-07 18:02:27,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:02:27,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617326818] [2019-12-07 18:02:27,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 33 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with mathsat -unsat_core_generation=3 [2019-12-07 18:02:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:27,250 INFO L264 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:02:27,251 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:02:27,272 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-12-07 18:02:27,272 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:02:27,289 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-12-07 18:02:27,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617326818] [2019-12-07 18:02:27,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:02:27,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 18:02:27,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109595775] [2019-12-07 18:02:27,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:02:27,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:02:27,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:02:27,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:02:27,290 INFO L87 Difference]: Start difference. First operand 609 states and 825 transitions. Second operand 3 states. [2019-12-07 18:02:28,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:02:28,215 INFO L93 Difference]: Finished difference Result 1783 states and 2423 transitions. [2019-12-07 18:02:28,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:02:28,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-12-07 18:02:28,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:02:28,219 INFO L225 Difference]: With dead ends: 1783 [2019-12-07 18:02:28,219 INFO L226 Difference]: Without dead ends: 1193 [2019-12-07 18:02:28,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:02:28,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2019-12-07 18:02:28,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1193. [2019-12-07 18:02:28,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2019-12-07 18:02:28,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1614 transitions. [2019-12-07 18:02:28,244 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1614 transitions. Word has length 164 [2019-12-07 18:02:28,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:02:28,244 INFO L462 AbstractCegarLoop]: Abstraction has 1193 states and 1614 transitions. [2019-12-07 18:02:28,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:02:28,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1614 transitions. [2019-12-07 18:02:28,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-07 18:02:28,245 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:02:28,245 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:02:28,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 mathsat -unsat_core_generation=3 [2019-12-07 18:02:28,446 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:02:28,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:28,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1876567476, now seen corresponding path program 1 times [2019-12-07 18:02:28,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:02:28,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586313603] [2019-12-07 18:02:28,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 34 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with mathsat -unsat_core_generation=3 [2019-12-07 18:02:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:28,620 INFO L264 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:02:28,621 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:02:28,624 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:02:28,624 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:28,627 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:28,627 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:28,627 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:02:28,633 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:02:28,633 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:28,635 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:28,635 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:28,635 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:02:28,664 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 18:02:28,664 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:02:28,698 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 18:02:28,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586313603] [2019-12-07 18:02:28,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:02:28,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:02:28,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28140717] [2019-12-07 18:02:28,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:02:28,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:02:28,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:02:28,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:02:28,699 INFO L87 Difference]: Start difference. First operand 1193 states and 1614 transitions. Second operand 6 states. [2019-12-07 18:02:33,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:02:33,666 INFO L93 Difference]: Finished difference Result 2541 states and 3437 transitions. [2019-12-07 18:02:33,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:02:33,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2019-12-07 18:02:33,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:02:33,673 INFO L225 Difference]: With dead ends: 2541 [2019-12-07 18:02:33,673 INFO L226 Difference]: Without dead ends: 1351 [2019-12-07 18:02:33,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:02:33,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2019-12-07 18:02:33,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1185. [2019-12-07 18:02:33,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-12-07 18:02:33,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1578 transitions. [2019-12-07 18:02:33,700 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1578 transitions. Word has length 165 [2019-12-07 18:02:33,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:02:33,700 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 1578 transitions. [2019-12-07 18:02:33,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:02:33,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1578 transitions. [2019-12-07 18:02:33,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-07 18:02:33,701 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:02:33,702 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:02:33,902 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 mathsat -unsat_core_generation=3 [2019-12-07 18:02:33,902 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:02:33,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:33,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1370865435, now seen corresponding path program 1 times [2019-12-07 18:02:33,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:02:33,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031493400] [2019-12-07 18:02:33,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 35 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with mathsat -unsat_core_generation=3 [2019-12-07 18:02:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:34,037 INFO L264 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:02:34,038 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:02:34,059 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 18:02:34,059 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:02:34,077 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 18:02:34,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031493400] [2019-12-07 18:02:34,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:02:34,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 18:02:34,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207530420] [2019-12-07 18:02:34,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:02:34,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:02:34,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:02:34,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:02:34,078 INFO L87 Difference]: Start difference. First operand 1185 states and 1578 transitions. Second operand 3 states. [2019-12-07 18:02:36,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:02:36,132 INFO L93 Difference]: Finished difference Result 2896 states and 3863 transitions. [2019-12-07 18:02:36,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:02:36,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-12-07 18:02:36,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:02:36,138 INFO L225 Difference]: With dead ends: 2896 [2019-12-07 18:02:36,138 INFO L226 Difference]: Without dead ends: 1730 [2019-12-07 18:02:36,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:02:36,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2019-12-07 18:02:36,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1728. [2019-12-07 18:02:36,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1728 states. [2019-12-07 18:02:36,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 2301 transitions. [2019-12-07 18:02:36,174 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 2301 transitions. Word has length 165 [2019-12-07 18:02:36,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:02:36,174 INFO L462 AbstractCegarLoop]: Abstraction has 1728 states and 2301 transitions. [2019-12-07 18:02:36,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:02:36,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2301 transitions. [2019-12-07 18:02:36,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 18:02:36,175 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:02:36,175 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:02:36,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 mathsat -unsat_core_generation=3 [2019-12-07 18:02:36,376 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:02:36,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:36,377 INFO L82 PathProgramCache]: Analyzing trace with hash -730951185, now seen corresponding path program 1 times [2019-12-07 18:02:36,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:02:36,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145619332] [2019-12-07 18:02:36,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 36 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with mathsat -unsat_core_generation=3 [2019-12-07 18:02:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:36,526 INFO L264 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:02:36,527 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:02:36,548 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 18:02:36,548 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:02:36,566 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 18:02:36,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145619332] [2019-12-07 18:02:36,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:02:36,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 18:02:36,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678614169] [2019-12-07 18:02:36,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:02:36,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:02:36,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:02:36,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:02:36,568 INFO L87 Difference]: Start difference. First operand 1728 states and 2301 transitions. Second operand 3 states. [2019-12-07 18:02:37,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:02:37,090 INFO L93 Difference]: Finished difference Result 3973 states and 5302 transitions. [2019-12-07 18:02:37,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:02:37,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-12-07 18:02:37,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:02:37,097 INFO L225 Difference]: With dead ends: 3973 [2019-12-07 18:02:37,097 INFO L226 Difference]: Without dead ends: 2264 [2019-12-07 18:02:37,098 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:02:37,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2019-12-07 18:02:37,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2242. [2019-12-07 18:02:37,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2242 states. [2019-12-07 18:02:37,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 2997 transitions. [2019-12-07 18:02:37,144 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 2997 transitions. Word has length 166 [2019-12-07 18:02:37,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:02:37,144 INFO L462 AbstractCegarLoop]: Abstraction has 2242 states and 2997 transitions. [2019-12-07 18:02:37,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:02:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 2997 transitions. [2019-12-07 18:02:37,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 18:02:37,146 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:02:37,146 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:02:37,346 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 mathsat -unsat_core_generation=3 [2019-12-07 18:02:37,347 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:02:37,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:37,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1165456783, now seen corresponding path program 1 times [2019-12-07 18:02:37,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:02:37,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107743232] [2019-12-07 18:02:37,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 37 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with mathsat -unsat_core_generation=3 [2019-12-07 18:02:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:37,605 INFO L264 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:02:37,607 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:02:37,624 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 18:02:37,624 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:02:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 18:02:37,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107743232] [2019-12-07 18:02:37,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:02:37,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 18:02:37,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796822579] [2019-12-07 18:02:37,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:02:37,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:02:37,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:02:37,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:02:37,640 INFO L87 Difference]: Start difference. First operand 2242 states and 2997 transitions. Second operand 3 states. [2019-12-07 18:02:39,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:02:39,198 INFO L93 Difference]: Finished difference Result 4514 states and 6039 transitions. [2019-12-07 18:02:39,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:02:39,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-12-07 18:02:39,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:02:39,206 INFO L225 Difference]: With dead ends: 4514 [2019-12-07 18:02:39,206 INFO L226 Difference]: Without dead ends: 2291 [2019-12-07 18:02:39,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:02:39,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2019-12-07 18:02:39,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2291. [2019-12-07 18:02:39,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2019-12-07 18:02:39,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3063 transitions. [2019-12-07 18:02:39,254 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3063 transitions. Word has length 166 [2019-12-07 18:02:39,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:02:39,254 INFO L462 AbstractCegarLoop]: Abstraction has 2291 states and 3063 transitions. [2019-12-07 18:02:39,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:02:39,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3063 transitions. [2019-12-07 18:02:39,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 18:02:39,255 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:02:39,255 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:02:39,456 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 mathsat -unsat_core_generation=3 [2019-12-07 18:02:39,456 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:02:39,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:39,457 INFO L82 PathProgramCache]: Analyzing trace with hash 765668851, now seen corresponding path program 1 times [2019-12-07 18:02:39,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:02:39,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938511084] [2019-12-07 18:02:39,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 38 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with mathsat -unsat_core_generation=3 [2019-12-07 18:02:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:39,834 INFO L264 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:02:39,836 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:02:39,852 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-12-07 18:02:39,852 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:02:39,866 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-12-07 18:02:39,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938511084] [2019-12-07 18:02:39,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:02:39,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 18:02:39,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802619195] [2019-12-07 18:02:39,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:02:39,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:02:39,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:02:39,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:02:39,867 INFO L87 Difference]: Start difference. First operand 2291 states and 3063 transitions. Second operand 3 states. [2019-12-07 18:02:39,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:02:39,916 INFO L93 Difference]: Finished difference Result 4587 states and 6136 transitions. [2019-12-07 18:02:39,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:02:39,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-12-07 18:02:39,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:02:39,923 INFO L225 Difference]: With dead ends: 4587 [2019-12-07 18:02:39,923 INFO L226 Difference]: Without dead ends: 2315 [2019-12-07 18:02:39,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:02:39,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2019-12-07 18:02:39,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2315. [2019-12-07 18:02:39,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2315 states. [2019-12-07 18:02:39,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 3095 transitions. [2019-12-07 18:02:39,972 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 3095 transitions. Word has length 166 [2019-12-07 18:02:39,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:02:39,973 INFO L462 AbstractCegarLoop]: Abstraction has 2315 states and 3095 transitions. [2019-12-07 18:02:39,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:02:39,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3095 transitions. [2019-12-07 18:02:39,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-12-07 18:02:39,974 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:02:39,974 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:02:40,175 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 mathsat -unsat_core_generation=3 [2019-12-07 18:02:40,176 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:02:40,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:40,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1394677973, now seen corresponding path program 1 times [2019-12-07 18:02:40,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:02:40,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928761008] [2019-12-07 18:02:40,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/mathsat Starting monitored process 39 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with mathsat -unsat_core_generation=3 [2019-12-07 18:02:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:40,656 INFO L264 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 18:02:40,660 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:02:40,753 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 18:02:40,753 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:40,953 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 18:02:40,953 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:40,955 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_354|], 2=[|v_#memory_$Pointer$.base_348|, |v_#memory_$Pointer$.base_347|]} [2019-12-07 18:02:40,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:40,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:40,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:40,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:40,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:40,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,003 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 18:02:41,003 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:41,101 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:41,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,125 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 18:02:41,125 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:41,160 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:41,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,167 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 18:02:41,168 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:41,181 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:41,182 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:41,182 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:84, output treesize:14 [2019-12-07 18:02:41,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,193 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 18:02:41,193 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:41,198 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:41,198 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:41,198 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 18:02:41,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,203 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 18:02:41,203 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:41,208 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:41,208 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:41,208 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 18:02:41,213 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:02:41,230 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:41,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,234 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-12-07 18:02:41,234 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:41,242 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:41,242 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:41,242 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 18:02:41,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 18:02:41,248 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:41,254 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:41,255 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:41,255 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 18:02:41,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,258 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 18:02:41,258 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:41,263 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:41,263 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:41,263 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 18:02:41,267 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:02:41,285 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:41,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,288 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-12-07 18:02:41,289 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:41,296 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:41,296 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:41,296 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 18:02:41,299 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_349|], 2=[|v_#memory_$Pointer$.base_361|]} [2019-12-07 18:02:41,301 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-12-07 18:02:41,302 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:02:41,314 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:41,343 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:41,343 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2019-12-07 18:02:41,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:41,345 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:41,358 INFO L614 ElimStorePlain]: treesize reduction 40, result has 25.9 percent of original size [2019-12-07 18:02:41,358 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:41,358 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-12-07 18:02:41,368 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:02:41,384 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:41,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,388 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-12-07 18:02:41,388 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:41,396 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:41,396 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:41,396 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 18:02:41,399 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_350|], 2=[|v_#memory_$Pointer$.base_363|]} [2019-12-07 18:02:41,402 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-12-07 18:02:41,402 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:02:41,414 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:41,445 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:41,445 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2019-12-07 18:02:41,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:02:41,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:41,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:41,446 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 18:02:41,463 INFO L614 ElimStorePlain]: treesize reduction 52, result has 21.2 percent of original size [2019-12-07 18:02:41,464 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:41,464 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-12-07 18:02:41,466 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_406|, |v_#memory_$Pointer$.offset_351|], 2=[|v_#memory_$Pointer$.offset_348|, |v_#memory_$Pointer$.base_364|, |v_#memory_$Pointer$.base_352|], 6=[|v_#memory_$Pointer$.offset_347|, |v_#memory_$Pointer$.base_353|]} [2019-12-07 18:02:41,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:41,548 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2019-12-07 18:02:41,548 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:42,077 WARN L192 SmtUtils]: Spent 528.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-07 18:02:42,078 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:42,115 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2019-12-07 18:02:42,115 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:42,473 WARN L192 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-07 18:02:42,473 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:42,484 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:02:42,805 WARN L192 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-12-07 18:02:42,806 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:42,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:42,869 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 18:02:42,869 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:43,022 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-12-07 18:02:43,022 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:43,026 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:02:43,175 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 18:02:43,176 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:43,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:43,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 106 [2019-12-07 18:02:43,181 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:43,235 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:43,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:59,477 WARN L192 SmtUtils]: Spent 16.24 s on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 18:02:59,477 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:59,478 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 166 [2019-12-07 18:02:59,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:02:59,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:02:59,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:59,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:59,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:59,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:02:59,481 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 5 xjuncts. [2019-12-07 18:02:59,607 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-12-07 18:02:59,608 INFO L614 ElimStorePlain]: treesize reduction 744, result has 11.3 percent of original size [2019-12-07 18:02:59,608 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:59,608 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:297, output treesize:53 [2019-12-07 18:02:59,636 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_352|, |v_#memory_$Pointer$.base_365|], 12=[|v_#memory_int_407|]} [2019-12-07 18:02:59,639 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2019-12-07 18:02:59,639 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:02:59,661 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:59,663 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 33 [2019-12-07 18:02:59,664 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:02:59,685 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:59,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:02:59,689 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 18:02:59,689 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:59,701 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:59,702 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:02:59,702 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:84, output treesize:41 [2019-12-07 18:02:59,747 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2019-12-07 18:02:59,747 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:59,751 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:59,752 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:59,752 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:3 [2019-12-07 18:02:59,906 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 18:02:59,906 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:02:59,954 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|v_#memory_$Pointer$.offset_348|, |v_#memory_$Pointer$.base_367|, |v_#memory_$Pointer$.offset_354|, |v_#memory_$Pointer$.base_352|], 3=[|#memory_int|], 6=[|v_#memory_$Pointer$.offset_347|, |v_#memory_$Pointer$.base_353|]} [2019-12-07 18:02:59,999 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-12-07 18:02:59,999 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:03:00,514 WARN L192 SmtUtils]: Spent 514.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 18:03:00,514 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:03:00,526 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:03:00,896 WARN L192 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-12-07 18:03:00,896 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:03:00,906 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:03:01,109 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-12-07 18:03:01,109 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:03:01,114 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:03:01,210 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:03:01,213 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:03:01,265 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:03:01,270 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3240 treesize of output 2904 [2019-12-07 18:03:01,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:03:01,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:03:01,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:03:01,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:03:01,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:03:01,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:03:01,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:03:01,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:03:01,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:03:01,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:03:01,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:03:01,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:03:01,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:03:01,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:03:01,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:03:01,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:03:01,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:03:01,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:03:01,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:03:01,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:03:01,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:03:01,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:03:01,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:03:01,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:03:01,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:03:01,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:03:01,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:03:01,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:03:01,280 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 18:03:01,542 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-12-07 18:03:01,542 INFO L614 ElimStorePlain]: treesize reduction 3675, result has 5.5 percent of original size [2019-12-07 18:03:09,745 WARN L192 SmtUtils]: Spent 8.19 s on a formula simplification that was a NOOP. DAG size: 29 [2019-12-07 18:03:09,746 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:03:09,746 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 92 [2019-12-07 18:03:09,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:03:09,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:03:09,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:03:09,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:03:09,785 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:03:09,785 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 52 [2019-12-07 18:03:09,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:03:09,793 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:03:09,794 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_83], 1=[v_arrayElimCell_84]} [2019-12-07 18:03:09,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928761008] [2019-12-07 18:03:09,798 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@4b0220e4 [2019-12-07 18:03:09,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [378367069] [2019-12-07 18:03:09,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/cvc4 Starting monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 18:03:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:03:12,156 INFO L264 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 56 conjunts are in the unsatisfiable core [2019-12-07 18:03:12,156 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@4b0220e4 [2019-12-07 18:03:12,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705164119] [2019-12-07 18:03:12,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8d4909-bda7-407a-a0c3-ba81d098d28f/bin/uautomizer/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:03:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:03:12,567 INFO L264 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 50 conjunts are in the unsatisfiable core [2019-12-07 18:03:12,568 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@4b0220e4 [2019-12-07 18:03:12,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:03:12,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 18:03:12,568 ERROR L206 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2019-12-07 18:03:12,568 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:03:13,172 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 mathsat -unsat_core_generation=3,40 cvc4 --incremental --print-success --lang smt --rewrite-divk,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:03:13,211 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 18:03:13,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:03:13 BoogieIcfgContainer [2019-12-07 18:03:13,211 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:03:13,211 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:03:13,211 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:03:13,211 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:03:13,212 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:58:47" (3/4) ... [2019-12-07 18:03:13,214 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 18:03:13,214 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:03:13,215 INFO L168 Benchmark]: Toolchain (without parser) took 269293.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -153.9 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:03:13,215 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:03:13,215 INFO L168 Benchmark]: CACSL2BoogieTranslator took 420.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -149.9 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:03:13,215 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:03:13,215 INFO L168 Benchmark]: Boogie Preprocessor took 54.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:03:13,216 INFO L168 Benchmark]: RCFGBuilder took 2679.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 975.3 MB in the end (delta: 106.3 MB). Peak memory consumption was 106.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:03:13,216 INFO L168 Benchmark]: TraceAbstraction took 266078.12 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 31.5 MB). Free memory was 975.3 MB in the beginning and 1.1 GB in the end (delta: -132.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:03:13,216 INFO L168 Benchmark]: Witness Printer took 2.66 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:03:13,217 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 420.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -149.9 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2679.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 975.3 MB in the end (delta: 106.3 MB). Peak memory consumption was 106.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 266078.12 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 31.5 MB). Free memory was 975.3 MB in the beginning and 1.1 GB in the end (delta: -132.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.66 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1711]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) [L1130] EXPR s->cert [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 [L1670] EXPR s->s3 [L1670] EXPR (s->s3)->tmp.reuse_message [L1670] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1699] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 [L1347] COND FALSE !(ret <= 0) [L1352] s->hit [L1352] COND FALSE !(s->hit) [L1355] s->state = 8512 [L1357] s->init_num = 0 [L1670] EXPR s->s3 [L1670] EXPR (s->s3)->tmp.reuse_message [L1670] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1699] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND TRUE s->state == 8512 [L1361] EXPR s->s3 [L1361] EXPR (s->s3)->tmp.new_cipher [L1361] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1361] COND TRUE ((s->s3)->tmp.new_cipher)->algorithms & 256UL [L1362] skip = 1 [L1371] s->state = 8528 [L1372] s->init_num = 0 [L1670] EXPR s->s3 [L1670] EXPR (s->s3)->tmp.reuse_message [L1670] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1699] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND TRUE s->state == 8528 [L1376] EXPR s->s3 [L1376] EXPR (s->s3)->tmp.new_cipher [L1376] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1376] l = ((s->s3)->tmp.new_cipher)->algorithms [L1377] EXPR s->options [L1377] COND TRUE s->options & 2097152UL [L1378] EXPR s->s3 [L1378] (s->s3)->tmp.use_rsa_tmp = 1 [L1382] EXPR s->s3 [L1382] (s->s3)->tmp.use_rsa_tmp [L1382] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1400] ret = __VERIFIER_nondet_int() [L1401] COND FALSE !(ret <= 0) [L1418] s->state = 8544 [L1419] s->init_num = 0 [L1670] EXPR s->s3 [L1670] EXPR (s->s3)->tmp.reuse_message [L1670] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1699] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND TRUE s->state == 8544 [L1423] EXPR s->verify_mode [L1423] COND TRUE s->verify_mode & 1 [L1424] EXPR s->session [L1424] EXPR (s->session)->peer [L1424] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1434] EXPR s->s3 [L1434] EXPR (s->s3)->tmp.new_cipher [L1434] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1434] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1444] EXPR s->s3 [L1444] (s->s3)->tmp.cert_request = 1 [L1445] ret = __VERIFIER_nondet_int() [L1446] COND FALSE !(ret <= 0) [L1451] s->state = 8448 [L1452] EXPR s->s3 [L1452] (s->s3)->tmp.next_state = 8576 [L1453] s->init_num = 0 [L1670] EXPR s->s3 [L1670] EXPR (s->s3)->tmp.reuse_message [L1670] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1699] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND TRUE s->state == 8448 [L1475] COND FALSE !(num1 > 0L) [L1488] EXPR s->s3 [L1488] EXPR (s->s3)->tmp.next_state [L1488] s->state = (s->s3)->tmp.next_state [L1670] EXPR s->s3 [L1670] EXPR (s->s3)->tmp.reuse_message [L1670] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1699] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND TRUE s->state == 8640 [L1535] ret = __VERIFIER_nondet_int() [L1536] COND FALSE !(blastFlag == 4) [L1711] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Result: UNKNOWN, OverallTime: 266.0s, OverallIterations: 38, TraceHistogramMax: 7, AutomataDifference: 207.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5732 SDtfs, 5617 SDslu, 12628 SDs, 0 SdLazy, 12615 SolverSat, 2085 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 197.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8612 GetRequests, 8413 SyntacticMatches, 8 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2315occurred in iteration=37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 37 MinimizatonAttempts, 3806 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 4312 NumberOfCodeBlocks, 4312 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 8550 ConstructedInterpolants, 0 QuantifiedInterpolants, 2657472 SizeOfPredicates, 100 NumberOfNonLiveVariables, 10512 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 74 InterpolantComputations, 74 PerfectInterpolantSequences, 8530/8530 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...