./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/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 a76e61da8563dd867a04fa03c43a1d8e84863fd7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/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 a76e61da8563dd867a04fa03c43a1d8e84863fd7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: expected NNF --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:28:30,608 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:28:30,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:28:30,619 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:28:30,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:28:30,621 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:28:30,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:28:30,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:28:30,626 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:28:30,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:28:30,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:28:30,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:28:30,630 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:28:30,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:28:30,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:28:30,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:28:30,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:28:30,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:28:30,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:28:30,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:28:30,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:28:30,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:28:30,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:28:30,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:28:30,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:28:30,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:28:30,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:28:30,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:28:30,647 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:28:30,648 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:28:30,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:28:30,649 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:28:30,650 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:28:30,651 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:28:30,652 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:28:30,652 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:28:30,653 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:28:30,653 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:28:30,653 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:28:30,654 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:28:30,655 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:28:30,655 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:28:30,668 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:28:30,669 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:28:30,670 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:28:30,670 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:28:30,670 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:28:30,671 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:28:30,671 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:28:30,671 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:28:30,671 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:28:30,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:28:30,672 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:28:30,672 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:28:30,672 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:28:30,672 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:28:30,673 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:28:30,673 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:28:30,673 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:28:30,673 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:28:30,674 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:28:30,674 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:28:30,674 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:28:30,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:28:30,674 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:28:30,675 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:28:30,675 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:28:30,675 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:28:30,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:28:30,676 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:28:30,676 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_040d83ce-e0f3-497c-ad73-3a800d791337/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 -> a76e61da8563dd867a04fa03c43a1d8e84863fd7 [2019-11-15 23:28:30,701 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:28:30,710 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:28:30,714 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:28:30,715 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:28:30,715 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:28:30,716 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-1.c [2019-11-15 23:28:30,766 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/data/a31d3a46d/b57118341be34fed9b371c16352c6401/FLAG687812a1a [2019-11-15 23:28:31,366 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:28:31,369 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-1.c [2019-11-15 23:28:31,403 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/data/a31d3a46d/b57118341be34fed9b371c16352c6401/FLAG687812a1a [2019-11-15 23:28:31,787 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/data/a31d3a46d/b57118341be34fed9b371c16352c6401 [2019-11-15 23:28:31,790 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:28:31,791 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:28:31,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:28:31,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:28:31,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:28:31,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:28:31" (1/1) ... [2019-11-15 23:28:31,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@639c601d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:28:31, skipping insertion in model container [2019-11-15 23:28:31,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:28:31" (1/1) ... [2019-11-15 23:28:31,811 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:28:31,884 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:28:32,392 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:28:32,420 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:28:32,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:28:32,596 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:28:32,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:28:32 WrapperNode [2019-11-15 23:28:32,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:28:32,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:28:32,597 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:28:32,597 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:28:32,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:28:32" (1/1) ... [2019-11-15 23:28:32,646 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:28:32" (1/1) ... [2019-11-15 23:28:32,702 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:28:32,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:28:32,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:28:32,703 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:28:32,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:28:32" (1/1) ... [2019-11-15 23:28:32,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:28:32" (1/1) ... [2019-11-15 23:28:32,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:28:32" (1/1) ... [2019-11-15 23:28:32,721 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:28:32" (1/1) ... [2019-11-15 23:28:32,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:28:32" (1/1) ... [2019-11-15 23:28:32,786 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:28:32" (1/1) ... [2019-11-15 23:28:32,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:28:32" (1/1) ... [2019-11-15 23:28:32,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:28:32,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:28:32,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:28:32,796 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:28:32,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:28:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:28:32,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:28:32,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:28:32,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:28:32,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:28:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:28:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:28:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:28:32,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:28:33,090 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:28:33,922 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 23:28:33,923 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 23:28:33,924 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:28:33,924 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:28:33,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:28:33 BoogieIcfgContainer [2019-11-15 23:28:33,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:28:33,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:28:33,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:28:33,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:28:33,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:28:31" (1/3) ... [2019-11-15 23:28:33,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6000ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:28:33, skipping insertion in model container [2019-11-15 23:28:33,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:28:32" (2/3) ... [2019-11-15 23:28:33,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6000ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:28:33, skipping insertion in model container [2019-11-15 23:28:33,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:28:33" (3/3) ... [2019-11-15 23:28:33,940 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.10.i.cil-1.c [2019-11-15 23:28:33,949 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:28:33,955 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:28:33,963 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:28:33,981 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:28:33,981 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:28:33,981 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:28:33,981 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:28:33,981 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:28:33,981 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:28:33,982 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:28:33,982 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:28:33,997 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-11-15 23:28:34,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 23:28:34,006 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:34,007 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:34,008 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:34,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:34,013 INFO L82 PathProgramCache]: Analyzing trace with hash 556191018, now seen corresponding path program 1 times [2019-11-15 23:28:34,021 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:34,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21317739] [2019-11-15 23:28:34,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:34,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:34,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:34,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:28:34,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21317739] [2019-11-15 23:28:34,333 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:34,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:34,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642066883] [2019-11-15 23:28:34,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:34,340 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:34,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:34,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:34,354 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 4 states. [2019-11-15 23:28:34,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:34,873 INFO L93 Difference]: Finished difference Result 319 states and 539 transitions. [2019-11-15 23:28:34,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:34,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-15 23:28:34,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:34,886 INFO L225 Difference]: With dead ends: 319 [2019-11-15 23:28:34,887 INFO L226 Difference]: Without dead ends: 161 [2019-11-15 23:28:34,890 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:34,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-15 23:28:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 144. [2019-11-15 23:28:34,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-15 23:28:34,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 222 transitions. [2019-11-15 23:28:34,933 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 222 transitions. Word has length 42 [2019-11-15 23:28:34,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:34,933 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 222 transitions. [2019-11-15 23:28:34,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:34,933 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 222 transitions. [2019-11-15 23:28:34,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 23:28:34,936 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:34,936 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:34,936 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:34,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:34,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1301055948, now seen corresponding path program 1 times [2019-11-15 23:28:34,937 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:34,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265610629] [2019-11-15 23:28:34,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:34,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:34,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:35,063 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:28:35,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265610629] [2019-11-15 23:28:35,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:35,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:35,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188068793] [2019-11-15 23:28:35,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:35,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:35,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:35,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:35,066 INFO L87 Difference]: Start difference. First operand 144 states and 222 transitions. Second operand 4 states. [2019-11-15 23:28:35,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:35,476 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2019-11-15 23:28:35,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:35,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-11-15 23:28:35,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:35,479 INFO L225 Difference]: With dead ends: 286 [2019-11-15 23:28:35,479 INFO L226 Difference]: Without dead ends: 161 [2019-11-15 23:28:35,481 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:35,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-15 23:28:35,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 144. [2019-11-15 23:28:35,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-15 23:28:35,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 221 transitions. [2019-11-15 23:28:35,494 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 221 transitions. Word has length 55 [2019-11-15 23:28:35,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:35,495 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 221 transitions. [2019-11-15 23:28:35,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:35,495 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 221 transitions. [2019-11-15 23:28:35,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 23:28:35,497 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:35,498 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:35,498 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:35,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:35,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1060532474, now seen corresponding path program 1 times [2019-11-15 23:28:35,499 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:35,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725403009] [2019-11-15 23:28:35,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:35,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:35,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:35,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:28:35,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725403009] [2019-11-15 23:28:35,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:35,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:35,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290238496] [2019-11-15 23:28:35,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:35,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:35,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:35,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:35,671 INFO L87 Difference]: Start difference. First operand 144 states and 221 transitions. Second operand 4 states. [2019-11-15 23:28:36,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:36,035 INFO L93 Difference]: Finished difference Result 285 states and 433 transitions. [2019-11-15 23:28:36,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:36,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-15 23:28:36,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:36,037 INFO L225 Difference]: With dead ends: 285 [2019-11-15 23:28:36,037 INFO L226 Difference]: Without dead ends: 160 [2019-11-15 23:28:36,038 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:36,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-15 23:28:36,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 144. [2019-11-15 23:28:36,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-15 23:28:36,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 220 transitions. [2019-11-15 23:28:36,047 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 220 transitions. Word has length 56 [2019-11-15 23:28:36,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:36,047 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 220 transitions. [2019-11-15 23:28:36,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:36,048 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 220 transitions. [2019-11-15 23:28:36,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 23:28:36,049 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:36,050 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:36,050 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:36,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:36,059 INFO L82 PathProgramCache]: Analyzing trace with hash 198008687, now seen corresponding path program 1 times [2019-11-15 23:28:36,059 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:36,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045205477] [2019-11-15 23:28:36,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:36,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:36,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:36,160 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:28:36,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045205477] [2019-11-15 23:28:36,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:36,161 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:36,161 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351622948] [2019-11-15 23:28:36,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:36,162 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:36,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:36,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:36,163 INFO L87 Difference]: Start difference. First operand 144 states and 220 transitions. Second operand 4 states. [2019-11-15 23:28:36,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:36,495 INFO L93 Difference]: Finished difference Result 283 states and 430 transitions. [2019-11-15 23:28:36,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:36,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-15 23:28:36,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:36,497 INFO L225 Difference]: With dead ends: 283 [2019-11-15 23:28:36,498 INFO L226 Difference]: Without dead ends: 158 [2019-11-15 23:28:36,498 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:36,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-15 23:28:36,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 144. [2019-11-15 23:28:36,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-15 23:28:36,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 219 transitions. [2019-11-15 23:28:36,509 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 219 transitions. Word has length 56 [2019-11-15 23:28:36,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:36,509 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 219 transitions. [2019-11-15 23:28:36,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:36,510 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 219 transitions. [2019-11-15 23:28:36,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 23:28:36,511 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:36,512 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:36,512 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:36,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:36,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1122844625, now seen corresponding path program 1 times [2019-11-15 23:28:36,512 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:36,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308968244] [2019-11-15 23:28:36,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:36,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:36,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:36,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:28:36,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308968244] [2019-11-15 23:28:36,612 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:36,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:36,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659692461] [2019-11-15 23:28:36,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:36,614 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:36,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:36,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:36,615 INFO L87 Difference]: Start difference. First operand 144 states and 219 transitions. Second operand 4 states. [2019-11-15 23:28:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:36,915 INFO L93 Difference]: Finished difference Result 282 states and 428 transitions. [2019-11-15 23:28:36,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:36,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-15 23:28:36,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:36,917 INFO L225 Difference]: With dead ends: 282 [2019-11-15 23:28:36,917 INFO L226 Difference]: Without dead ends: 157 [2019-11-15 23:28:36,917 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:36,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-15 23:28:36,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 144. [2019-11-15 23:28:36,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-15 23:28:36,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 218 transitions. [2019-11-15 23:28:36,930 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 218 transitions. Word has length 56 [2019-11-15 23:28:36,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:36,931 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 218 transitions. [2019-11-15 23:28:36,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:36,931 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 218 transitions. [2019-11-15 23:28:36,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 23:28:36,932 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:36,932 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:36,933 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:36,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:36,933 INFO L82 PathProgramCache]: Analyzing trace with hash 13021670, now seen corresponding path program 1 times [2019-11-15 23:28:36,933 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:36,933 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22634489] [2019-11-15 23:28:36,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:36,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:36,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:37,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:28:37,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22634489] [2019-11-15 23:28:37,013 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:37,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:37,014 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189148593] [2019-11-15 23:28:37,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:37,015 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:37,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:37,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:37,016 INFO L87 Difference]: Start difference. First operand 144 states and 218 transitions. Second operand 4 states. [2019-11-15 23:28:37,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:37,323 INFO L93 Difference]: Finished difference Result 282 states and 427 transitions. [2019-11-15 23:28:37,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:37,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-15 23:28:37,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:37,327 INFO L225 Difference]: With dead ends: 282 [2019-11-15 23:28:37,327 INFO L226 Difference]: Without dead ends: 157 [2019-11-15 23:28:37,327 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:37,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-15 23:28:37,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 144. [2019-11-15 23:28:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-15 23:28:37,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 217 transitions. [2019-11-15 23:28:37,333 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 217 transitions. Word has length 56 [2019-11-15 23:28:37,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:37,333 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 217 transitions. [2019-11-15 23:28:37,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:37,333 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 217 transitions. [2019-11-15 23:28:37,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 23:28:37,334 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:37,334 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:37,335 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:37,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:37,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1751285277, now seen corresponding path program 1 times [2019-11-15 23:28:37,335 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:37,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110045655] [2019-11-15 23:28:37,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:37,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:37,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:37,385 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:28:37,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110045655] [2019-11-15 23:28:37,386 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:37,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:37,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797161969] [2019-11-15 23:28:37,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:37,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:37,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:37,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:37,387 INFO L87 Difference]: Start difference. First operand 144 states and 217 transitions. Second operand 4 states. [2019-11-15 23:28:37,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:37,666 INFO L93 Difference]: Finished difference Result 282 states and 426 transitions. [2019-11-15 23:28:37,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:37,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-15 23:28:37,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:37,672 INFO L225 Difference]: With dead ends: 282 [2019-11-15 23:28:37,672 INFO L226 Difference]: Without dead ends: 157 [2019-11-15 23:28:37,673 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:37,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-15 23:28:37,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 144. [2019-11-15 23:28:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-15 23:28:37,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 216 transitions. [2019-11-15 23:28:37,678 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 216 transitions. Word has length 57 [2019-11-15 23:28:37,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:37,678 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 216 transitions. [2019-11-15 23:28:37,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:37,678 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 216 transitions. [2019-11-15 23:28:37,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 23:28:37,679 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:37,679 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:37,680 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:37,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:37,680 INFO L82 PathProgramCache]: Analyzing trace with hash 2062972321, now seen corresponding path program 1 times [2019-11-15 23:28:37,680 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:37,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696331744] [2019-11-15 23:28:37,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:37,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:37,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:37,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:28:37,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696331744] [2019-11-15 23:28:37,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:37,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:37,753 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184085411] [2019-11-15 23:28:37,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:37,754 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:37,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:37,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:37,755 INFO L87 Difference]: Start difference. First operand 144 states and 216 transitions. Second operand 4 states. [2019-11-15 23:28:38,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:38,049 INFO L93 Difference]: Finished difference Result 282 states and 425 transitions. [2019-11-15 23:28:38,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:38,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-15 23:28:38,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:38,051 INFO L225 Difference]: With dead ends: 282 [2019-11-15 23:28:38,051 INFO L226 Difference]: Without dead ends: 157 [2019-11-15 23:28:38,052 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:38,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-15 23:28:38,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 144. [2019-11-15 23:28:38,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-15 23:28:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 215 transitions. [2019-11-15 23:28:38,056 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 215 transitions. Word has length 58 [2019-11-15 23:28:38,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:38,057 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 215 transitions. [2019-11-15 23:28:38,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:38,057 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 215 transitions. [2019-11-15 23:28:38,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 23:28:38,058 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:38,058 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:38,058 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:38,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:38,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1575895618, now seen corresponding path program 1 times [2019-11-15 23:28:38,059 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:38,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689345790] [2019-11-15 23:28:38,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:38,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:38,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:28:38,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689345790] [2019-11-15 23:28:38,144 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:38,144 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:38,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530937044] [2019-11-15 23:28:38,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:38,147 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:38,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:38,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:38,147 INFO L87 Difference]: Start difference. First operand 144 states and 215 transitions. Second operand 4 states. [2019-11-15 23:28:38,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:38,424 INFO L93 Difference]: Finished difference Result 272 states and 411 transitions. [2019-11-15 23:28:38,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:38,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 23:28:38,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:38,425 INFO L225 Difference]: With dead ends: 272 [2019-11-15 23:28:38,425 INFO L226 Difference]: Without dead ends: 147 [2019-11-15 23:28:38,426 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:38,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-15 23:28:38,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2019-11-15 23:28:38,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-15 23:28:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 214 transitions. [2019-11-15 23:28:38,430 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 214 transitions. Word has length 59 [2019-11-15 23:28:38,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:38,431 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 214 transitions. [2019-11-15 23:28:38,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:38,431 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 214 transitions. [2019-11-15 23:28:38,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 23:28:38,431 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:38,432 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:38,432 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:38,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:38,432 INFO L82 PathProgramCache]: Analyzing trace with hash -902896810, now seen corresponding path program 1 times [2019-11-15 23:28:38,432 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:38,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119123885] [2019-11-15 23:28:38,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:38,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:38,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:38,484 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:28:38,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119123885] [2019-11-15 23:28:38,484 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:38,485 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:38,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777892978] [2019-11-15 23:28:38,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:38,485 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:38,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:38,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:38,486 INFO L87 Difference]: Start difference. First operand 144 states and 214 transitions. Second operand 4 states. [2019-11-15 23:28:38,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:38,786 INFO L93 Difference]: Finished difference Result 312 states and 472 transitions. [2019-11-15 23:28:38,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:38,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 23:28:38,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:38,788 INFO L225 Difference]: With dead ends: 312 [2019-11-15 23:28:38,788 INFO L226 Difference]: Without dead ends: 187 [2019-11-15 23:28:38,789 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:38,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-15 23:28:38,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 166. [2019-11-15 23:28:38,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-15 23:28:38,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 252 transitions. [2019-11-15 23:28:38,794 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 252 transitions. Word has length 59 [2019-11-15 23:28:38,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:38,794 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 252 transitions. [2019-11-15 23:28:38,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:38,795 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 252 transitions. [2019-11-15 23:28:38,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 23:28:38,795 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:38,796 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:38,796 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:38,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:38,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1928780576, now seen corresponding path program 1 times [2019-11-15 23:28:38,796 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:38,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069616218] [2019-11-15 23:28:38,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:38,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:38,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:38,857 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:28:38,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069616218] [2019-11-15 23:28:38,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:38,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:38,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597256729] [2019-11-15 23:28:38,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:38,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:38,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:38,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:38,858 INFO L87 Difference]: Start difference. First operand 166 states and 252 transitions. Second operand 4 states. [2019-11-15 23:28:39,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:39,145 INFO L93 Difference]: Finished difference Result 334 states and 509 transitions. [2019-11-15 23:28:39,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:39,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-15 23:28:39,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:39,147 INFO L225 Difference]: With dead ends: 334 [2019-11-15 23:28:39,147 INFO L226 Difference]: Without dead ends: 187 [2019-11-15 23:28:39,147 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:39,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-15 23:28:39,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 166. [2019-11-15 23:28:39,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-15 23:28:39,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 251 transitions. [2019-11-15 23:28:39,153 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 251 transitions. Word has length 72 [2019-11-15 23:28:39,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:39,153 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 251 transitions. [2019-11-15 23:28:39,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:39,153 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 251 transitions. [2019-11-15 23:28:39,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 23:28:39,154 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:39,155 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:39,155 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:39,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:39,155 INFO L82 PathProgramCache]: Analyzing trace with hash -954840538, now seen corresponding path program 1 times [2019-11-15 23:28:39,155 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:39,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699054022] [2019-11-15 23:28:39,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:39,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:39,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:39,196 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:28:39,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699054022] [2019-11-15 23:28:39,197 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:39,197 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:39,198 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910097285] [2019-11-15 23:28:39,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:39,198 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:39,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:39,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:39,199 INFO L87 Difference]: Start difference. First operand 166 states and 251 transitions. Second operand 4 states. [2019-11-15 23:28:39,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:39,508 INFO L93 Difference]: Finished difference Result 333 states and 506 transitions. [2019-11-15 23:28:39,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:39,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-15 23:28:39,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:39,511 INFO L225 Difference]: With dead ends: 333 [2019-11-15 23:28:39,511 INFO L226 Difference]: Without dead ends: 186 [2019-11-15 23:28:39,511 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:39,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-15 23:28:39,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 166. [2019-11-15 23:28:39,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-15 23:28:39,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 250 transitions. [2019-11-15 23:28:39,516 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 250 transitions. Word has length 73 [2019-11-15 23:28:39,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:39,517 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 250 transitions. [2019-11-15 23:28:39,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:39,517 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 250 transitions. [2019-11-15 23:28:39,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 23:28:39,517 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:39,518 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:39,518 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:39,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:39,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1817364325, now seen corresponding path program 1 times [2019-11-15 23:28:39,519 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:39,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034022971] [2019-11-15 23:28:39,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:39,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:39,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:39,578 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:28:39,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034022971] [2019-11-15 23:28:39,579 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:39,579 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:39,579 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415413645] [2019-11-15 23:28:39,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:39,586 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:39,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:39,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:39,588 INFO L87 Difference]: Start difference. First operand 166 states and 250 transitions. Second operand 4 states. [2019-11-15 23:28:39,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:39,918 INFO L93 Difference]: Finished difference Result 331 states and 502 transitions. [2019-11-15 23:28:39,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:39,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-15 23:28:39,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:39,920 INFO L225 Difference]: With dead ends: 331 [2019-11-15 23:28:39,920 INFO L226 Difference]: Without dead ends: 184 [2019-11-15 23:28:39,920 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:39,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-15 23:28:39,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 166. [2019-11-15 23:28:39,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-15 23:28:39,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 249 transitions. [2019-11-15 23:28:39,925 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 249 transitions. Word has length 73 [2019-11-15 23:28:39,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:39,926 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 249 transitions. [2019-11-15 23:28:39,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:39,926 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 249 transitions. [2019-11-15 23:28:39,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 23:28:39,928 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:39,928 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:39,928 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:39,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:39,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1156749659, now seen corresponding path program 1 times [2019-11-15 23:28:39,929 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:39,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727806902] [2019-11-15 23:28:39,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:39,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:39,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:39,991 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:28:39,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727806902] [2019-11-15 23:28:39,995 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:39,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:39,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115637187] [2019-11-15 23:28:39,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:39,996 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:39,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:39,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:39,997 INFO L87 Difference]: Start difference. First operand 166 states and 249 transitions. Second operand 4 states. [2019-11-15 23:28:40,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:40,345 INFO L93 Difference]: Finished difference Result 330 states and 499 transitions. [2019-11-15 23:28:40,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:40,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-15 23:28:40,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:40,346 INFO L225 Difference]: With dead ends: 330 [2019-11-15 23:28:40,346 INFO L226 Difference]: Without dead ends: 183 [2019-11-15 23:28:40,347 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:40,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-15 23:28:40,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 166. [2019-11-15 23:28:40,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-15 23:28:40,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 248 transitions. [2019-11-15 23:28:40,352 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 248 transitions. Word has length 73 [2019-11-15 23:28:40,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:40,352 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 248 transitions. [2019-11-15 23:28:40,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:40,352 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 248 transitions. [2019-11-15 23:28:40,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 23:28:40,353 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:40,353 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:40,353 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:40,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:40,354 INFO L82 PathProgramCache]: Analyzing trace with hash -2002351342, now seen corresponding path program 1 times [2019-11-15 23:28:40,354 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:40,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499171061] [2019-11-15 23:28:40,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:40,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:40,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:40,399 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:28:40,400 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499171061] [2019-11-15 23:28:40,400 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:40,400 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:40,400 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285182051] [2019-11-15 23:28:40,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:40,401 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:40,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:40,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:40,401 INFO L87 Difference]: Start difference. First operand 166 states and 248 transitions. Second operand 4 states. [2019-11-15 23:28:40,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:40,700 INFO L93 Difference]: Finished difference Result 330 states and 497 transitions. [2019-11-15 23:28:40,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:40,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-15 23:28:40,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:40,702 INFO L225 Difference]: With dead ends: 330 [2019-11-15 23:28:40,702 INFO L226 Difference]: Without dead ends: 183 [2019-11-15 23:28:40,703 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:40,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-15 23:28:40,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 166. [2019-11-15 23:28:40,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-15 23:28:40,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 247 transitions. [2019-11-15 23:28:40,712 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 247 transitions. Word has length 73 [2019-11-15 23:28:40,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:40,712 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 247 transitions. [2019-11-15 23:28:40,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:40,712 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 247 transitions. [2019-11-15 23:28:40,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 23:28:40,713 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:40,714 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:40,714 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:40,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:40,714 INFO L82 PathProgramCache]: Analyzing trace with hash 196660791, now seen corresponding path program 1 times [2019-11-15 23:28:40,714 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:40,715 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532493364] [2019-11-15 23:28:40,715 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:40,715 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:40,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:40,756 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:28:40,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532493364] [2019-11-15 23:28:40,758 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:40,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:40,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248555327] [2019-11-15 23:28:40,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:40,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:40,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:40,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:40,760 INFO L87 Difference]: Start difference. First operand 166 states and 247 transitions. Second operand 4 states. [2019-11-15 23:28:41,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:41,100 INFO L93 Difference]: Finished difference Result 330 states and 495 transitions. [2019-11-15 23:28:41,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:41,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-15 23:28:41,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:41,102 INFO L225 Difference]: With dead ends: 330 [2019-11-15 23:28:41,102 INFO L226 Difference]: Without dead ends: 183 [2019-11-15 23:28:41,103 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:41,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-15 23:28:41,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 166. [2019-11-15 23:28:41,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-15 23:28:41,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 246 transitions. [2019-11-15 23:28:41,108 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 246 transitions. Word has length 74 [2019-11-15 23:28:41,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:41,108 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 246 transitions. [2019-11-15 23:28:41,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:41,108 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 246 transitions. [2019-11-15 23:28:41,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 23:28:41,109 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:41,109 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:41,109 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:41,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:41,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1975209011, now seen corresponding path program 1 times [2019-11-15 23:28:41,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:41,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809582337] [2019-11-15 23:28:41,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:41,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:41,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:41,167 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:28:41,168 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809582337] [2019-11-15 23:28:41,168 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:41,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:41,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009005015] [2019-11-15 23:28:41,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:41,169 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:41,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:41,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:41,169 INFO L87 Difference]: Start difference. First operand 166 states and 246 transitions. Second operand 4 states. [2019-11-15 23:28:41,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:41,538 INFO L93 Difference]: Finished difference Result 330 states and 493 transitions. [2019-11-15 23:28:41,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:41,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-15 23:28:41,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:41,540 INFO L225 Difference]: With dead ends: 330 [2019-11-15 23:28:41,541 INFO L226 Difference]: Without dead ends: 183 [2019-11-15 23:28:41,541 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:41,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-15 23:28:41,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 166. [2019-11-15 23:28:41,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-15 23:28:41,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 245 transitions. [2019-11-15 23:28:41,546 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 245 transitions. Word has length 75 [2019-11-15 23:28:41,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:41,546 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 245 transitions. [2019-11-15 23:28:41,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:41,546 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 245 transitions. [2019-11-15 23:28:41,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 23:28:41,547 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:41,547 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:41,547 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:41,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:41,548 INFO L82 PathProgramCache]: Analyzing trace with hash 2089501970, now seen corresponding path program 1 times [2019-11-15 23:28:41,548 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:41,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244527549] [2019-11-15 23:28:41,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:41,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:41,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:41,606 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:28:41,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244527549] [2019-11-15 23:28:41,606 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:41,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:41,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914402315] [2019-11-15 23:28:41,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:41,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:41,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:41,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:41,607 INFO L87 Difference]: Start difference. First operand 166 states and 245 transitions. Second operand 4 states. [2019-11-15 23:28:41,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:41,907 INFO L93 Difference]: Finished difference Result 320 states and 478 transitions. [2019-11-15 23:28:41,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:41,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 23:28:41,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:41,909 INFO L225 Difference]: With dead ends: 320 [2019-11-15 23:28:41,909 INFO L226 Difference]: Without dead ends: 173 [2019-11-15 23:28:41,910 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:41,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-15 23:28:41,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 166. [2019-11-15 23:28:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-15 23:28:41,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 244 transitions. [2019-11-15 23:28:41,914 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 244 transitions. Word has length 76 [2019-11-15 23:28:41,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:41,914 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 244 transitions. [2019-11-15 23:28:41,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:41,914 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 244 transitions. [2019-11-15 23:28:41,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 23:28:41,915 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:41,915 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:41,915 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:41,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:41,916 INFO L82 PathProgramCache]: Analyzing trace with hash 2003727820, now seen corresponding path program 1 times [2019-11-15 23:28:41,916 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:41,916 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249121172] [2019-11-15 23:28:41,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:41,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:41,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:28:42,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249121172] [2019-11-15 23:28:42,009 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:42,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:42,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180603183] [2019-11-15 23:28:42,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:42,014 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:42,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:42,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:42,015 INFO L87 Difference]: Start difference. First operand 166 states and 244 transitions. Second operand 4 states. [2019-11-15 23:28:42,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:42,486 INFO L93 Difference]: Finished difference Result 419 states and 629 transitions. [2019-11-15 23:28:42,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:42,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-15 23:28:42,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:42,489 INFO L225 Difference]: With dead ends: 419 [2019-11-15 23:28:42,489 INFO L226 Difference]: Without dead ends: 272 [2019-11-15 23:28:42,489 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:42,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-15 23:28:42,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 207. [2019-11-15 23:28:42,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-11-15 23:28:42,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 318 transitions. [2019-11-15 23:28:42,495 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 318 transitions. Word has length 81 [2019-11-15 23:28:42,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:42,495 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 318 transitions. [2019-11-15 23:28:42,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:42,496 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 318 transitions. [2019-11-15 23:28:42,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 23:28:42,496 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:42,497 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:42,497 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:42,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:42,497 INFO L82 PathProgramCache]: Analyzing trace with hash 631920522, now seen corresponding path program 1 times [2019-11-15 23:28:42,497 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:42,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597185877] [2019-11-15 23:28:42,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:42,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:42,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:28:42,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597185877] [2019-11-15 23:28:42,557 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:42,557 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:42,557 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399271834] [2019-11-15 23:28:42,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:42,558 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:42,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:42,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:42,558 INFO L87 Difference]: Start difference. First operand 207 states and 318 transitions. Second operand 4 states. [2019-11-15 23:28:42,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:42,893 INFO L93 Difference]: Finished difference Result 444 states and 689 transitions. [2019-11-15 23:28:42,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:42,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-15 23:28:42,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:42,895 INFO L225 Difference]: With dead ends: 444 [2019-11-15 23:28:42,895 INFO L226 Difference]: Without dead ends: 256 [2019-11-15 23:28:42,896 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:42,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-15 23:28:42,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 231. [2019-11-15 23:28:42,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-15 23:28:42,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 360 transitions. [2019-11-15 23:28:42,903 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 360 transitions. Word has length 81 [2019-11-15 23:28:42,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:42,903 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 360 transitions. [2019-11-15 23:28:42,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:42,903 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 360 transitions. [2019-11-15 23:28:42,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 23:28:42,904 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:42,904 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:42,905 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:42,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:42,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1783613674, now seen corresponding path program 1 times [2019-11-15 23:28:42,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:42,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261214413] [2019-11-15 23:28:42,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:42,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:42,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:42,990 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:28:42,990 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261214413] [2019-11-15 23:28:42,990 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:42,990 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:42,990 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120051188] [2019-11-15 23:28:42,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:42,991 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:42,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:42,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:42,992 INFO L87 Difference]: Start difference. First operand 231 states and 360 transitions. Second operand 4 states. [2019-11-15 23:28:43,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:43,458 INFO L93 Difference]: Finished difference Result 501 states and 777 transitions. [2019-11-15 23:28:43,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:43,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-15 23:28:43,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:43,460 INFO L225 Difference]: With dead ends: 501 [2019-11-15 23:28:43,460 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 23:28:43,461 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:43,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 23:28:43,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 232. [2019-11-15 23:28:43,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-15 23:28:43,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 361 transitions. [2019-11-15 23:28:43,467 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 361 transitions. Word has length 82 [2019-11-15 23:28:43,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:43,468 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 361 transitions. [2019-11-15 23:28:43,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:43,468 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 361 transitions. [2019-11-15 23:28:43,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:28:43,469 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:43,469 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:43,469 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:43,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:43,469 INFO L82 PathProgramCache]: Analyzing trace with hash 491747434, now seen corresponding path program 1 times [2019-11-15 23:28:43,470 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:43,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542143912] [2019-11-15 23:28:43,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:43,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:43,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:28:43,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542143912] [2019-11-15 23:28:43,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:43,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:43,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883600627] [2019-11-15 23:28:43,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:43,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:43,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:43,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:43,544 INFO L87 Difference]: Start difference. First operand 232 states and 361 transitions. Second operand 4 states. [2019-11-15 23:28:44,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:44,056 INFO L93 Difference]: Finished difference Result 502 states and 777 transitions. [2019-11-15 23:28:44,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:44,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-15 23:28:44,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:44,061 INFO L225 Difference]: With dead ends: 502 [2019-11-15 23:28:44,061 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 23:28:44,062 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:44,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 23:28:44,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 232. [2019-11-15 23:28:44,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-15 23:28:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 360 transitions. [2019-11-15 23:28:44,068 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 360 transitions. Word has length 94 [2019-11-15 23:28:44,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:44,068 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 360 transitions. [2019-11-15 23:28:44,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:44,068 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 360 transitions. [2019-11-15 23:28:44,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:28:44,069 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:44,069 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:44,070 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:44,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:44,070 INFO L82 PathProgramCache]: Analyzing trace with hash 935648108, now seen corresponding path program 1 times [2019-11-15 23:28:44,070 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:44,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650892690] [2019-11-15 23:28:44,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:44,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:44,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:44,131 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:28:44,131 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650892690] [2019-11-15 23:28:44,131 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:44,132 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:44,132 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362660802] [2019-11-15 23:28:44,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:44,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:44,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:44,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:44,134 INFO L87 Difference]: Start difference. First operand 232 states and 360 transitions. Second operand 4 states. [2019-11-15 23:28:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:44,525 INFO L93 Difference]: Finished difference Result 470 states and 730 transitions. [2019-11-15 23:28:44,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:44,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-15 23:28:44,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:44,527 INFO L225 Difference]: With dead ends: 470 [2019-11-15 23:28:44,528 INFO L226 Difference]: Without dead ends: 257 [2019-11-15 23:28:44,528 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:44,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-11-15 23:28:44,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2019-11-15 23:28:44,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-15 23:28:44,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 359 transitions. [2019-11-15 23:28:44,536 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 359 transitions. Word has length 94 [2019-11-15 23:28:44,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:44,536 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 359 transitions. [2019-11-15 23:28:44,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:44,537 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2019-11-15 23:28:44,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:28:44,538 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:44,538 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:44,538 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:44,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:44,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1741772316, now seen corresponding path program 1 times [2019-11-15 23:28:44,539 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:44,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499844489] [2019-11-15 23:28:44,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:44,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:44,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:44,610 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:28:44,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499844489] [2019-11-15 23:28:44,610 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:44,610 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:44,610 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138829016] [2019-11-15 23:28:44,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:44,611 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:44,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:44,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:44,612 INFO L87 Difference]: Start difference. First operand 232 states and 359 transitions. Second operand 4 states. [2019-11-15 23:28:45,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:45,100 INFO L93 Difference]: Finished difference Result 501 states and 772 transitions. [2019-11-15 23:28:45,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:45,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 23:28:45,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:45,103 INFO L225 Difference]: With dead ends: 501 [2019-11-15 23:28:45,103 INFO L226 Difference]: Without dead ends: 288 [2019-11-15 23:28:45,103 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:45,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-15 23:28:45,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 232. [2019-11-15 23:28:45,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-15 23:28:45,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 358 transitions. [2019-11-15 23:28:45,109 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 358 transitions. Word has length 95 [2019-11-15 23:28:45,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:45,110 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 358 transitions. [2019-11-15 23:28:45,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:45,110 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 358 transitions. [2019-11-15 23:28:45,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:28:45,112 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:45,113 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:45,113 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:45,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:45,113 INFO L82 PathProgramCache]: Analyzing trace with hash 879248529, now seen corresponding path program 1 times [2019-11-15 23:28:45,113 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:45,113 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257308687] [2019-11-15 23:28:45,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:45,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:45,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:28:45,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257308687] [2019-11-15 23:28:45,198 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:45,198 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:45,198 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800363453] [2019-11-15 23:28:45,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:45,199 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:45,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:45,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:45,200 INFO L87 Difference]: Start difference. First operand 232 states and 358 transitions. Second operand 4 states. [2019-11-15 23:28:45,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:45,741 INFO L93 Difference]: Finished difference Result 499 states and 768 transitions. [2019-11-15 23:28:45,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:45,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 23:28:45,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:45,743 INFO L225 Difference]: With dead ends: 499 [2019-11-15 23:28:45,744 INFO L226 Difference]: Without dead ends: 286 [2019-11-15 23:28:45,744 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:45,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-11-15 23:28:45,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 232. [2019-11-15 23:28:45,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-15 23:28:45,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 357 transitions. [2019-11-15 23:28:45,793 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 357 transitions. Word has length 95 [2019-11-15 23:28:45,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:45,794 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 357 transitions. [2019-11-15 23:28:45,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:45,794 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 357 transitions. [2019-11-15 23:28:45,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:28:45,796 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:45,796 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:45,796 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:45,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:45,797 INFO L82 PathProgramCache]: Analyzing trace with hash -441604783, now seen corresponding path program 1 times [2019-11-15 23:28:45,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:45,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648707486] [2019-11-15 23:28:45,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:45,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:45,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:45,866 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:28:45,866 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648707486] [2019-11-15 23:28:45,867 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:45,867 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:45,867 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906458233] [2019-11-15 23:28:45,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:45,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:45,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:45,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:45,869 INFO L87 Difference]: Start difference. First operand 232 states and 357 transitions. Second operand 4 states. [2019-11-15 23:28:46,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:46,265 INFO L93 Difference]: Finished difference Result 498 states and 765 transitions. [2019-11-15 23:28:46,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:46,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 23:28:46,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:46,267 INFO L225 Difference]: With dead ends: 498 [2019-11-15 23:28:46,267 INFO L226 Difference]: Without dead ends: 285 [2019-11-15 23:28:46,268 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:46,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-15 23:28:46,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 232. [2019-11-15 23:28:46,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-15 23:28:46,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 356 transitions. [2019-11-15 23:28:46,274 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 356 transitions. Word has length 95 [2019-11-15 23:28:46,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:46,274 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 356 transitions. [2019-11-15 23:28:46,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:46,274 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 356 transitions. [2019-11-15 23:28:46,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:28:46,275 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:46,275 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:46,276 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:46,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:46,276 INFO L82 PathProgramCache]: Analyzing trace with hash 694261512, now seen corresponding path program 1 times [2019-11-15 23:28:46,276 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:46,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711401288] [2019-11-15 23:28:46,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:46,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:46,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:46,353 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 23:28:46,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711401288] [2019-11-15 23:28:46,353 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:46,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:28:46,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772780922] [2019-11-15 23:28:46,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:28:46,354 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:46,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:28:46,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:46,355 INFO L87 Difference]: Start difference. First operand 232 states and 356 transitions. Second operand 5 states. [2019-11-15 23:28:46,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:46,874 INFO L93 Difference]: Finished difference Result 466 states and 720 transitions. [2019-11-15 23:28:46,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:28:46,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-15 23:28:46,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:46,877 INFO L225 Difference]: With dead ends: 466 [2019-11-15 23:28:46,877 INFO L226 Difference]: Without dead ends: 253 [2019-11-15 23:28:46,877 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:28:46,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-15 23:28:46,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2019-11-15 23:28:46,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 23:28:46,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 382 transitions. [2019-11-15 23:28:46,884 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 382 transitions. Word has length 95 [2019-11-15 23:28:46,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:46,884 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 382 transitions. [2019-11-15 23:28:46,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:28:46,884 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 382 transitions. [2019-11-15 23:28:46,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:28:46,885 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:46,885 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:46,885 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:46,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:46,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1755267535, now seen corresponding path program 1 times [2019-11-15 23:28:46,886 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:46,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214562684] [2019-11-15 23:28:46,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:46,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:46,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:46,944 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:28:46,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214562684] [2019-11-15 23:28:46,945 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:46,945 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:46,945 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069853468] [2019-11-15 23:28:46,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:46,946 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:46,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:46,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:46,946 INFO L87 Difference]: Start difference. First operand 252 states and 382 transitions. Second operand 4 states. [2019-11-15 23:28:47,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:47,245 INFO L93 Difference]: Finished difference Result 507 states and 770 transitions. [2019-11-15 23:28:47,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:47,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 23:28:47,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:47,256 INFO L225 Difference]: With dead ends: 507 [2019-11-15 23:28:47,256 INFO L226 Difference]: Without dead ends: 274 [2019-11-15 23:28:47,257 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:47,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-11-15 23:28:47,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 252. [2019-11-15 23:28:47,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 23:28:47,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 381 transitions. [2019-11-15 23:28:47,275 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 381 transitions. Word has length 95 [2019-11-15 23:28:47,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:47,276 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 381 transitions. [2019-11-15 23:28:47,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:47,276 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 381 transitions. [2019-11-15 23:28:47,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:28:47,277 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:47,277 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:47,277 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:47,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:47,278 INFO L82 PathProgramCache]: Analyzing trace with hash 434414223, now seen corresponding path program 1 times [2019-11-15 23:28:47,278 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:47,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117772998] [2019-11-15 23:28:47,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:47,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:47,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:47,357 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:28:47,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117772998] [2019-11-15 23:28:47,358 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:47,358 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:47,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706512052] [2019-11-15 23:28:47,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:47,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:47,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:47,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:47,360 INFO L87 Difference]: Start difference. First operand 252 states and 381 transitions. Second operand 4 states. [2019-11-15 23:28:47,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:47,747 INFO L93 Difference]: Finished difference Result 506 states and 767 transitions. [2019-11-15 23:28:47,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:47,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 23:28:47,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:47,750 INFO L225 Difference]: With dead ends: 506 [2019-11-15 23:28:47,750 INFO L226 Difference]: Without dead ends: 273 [2019-11-15 23:28:47,750 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:47,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-15 23:28:47,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-11-15 23:28:47,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 23:28:47,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 380 transitions. [2019-11-15 23:28:47,757 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 380 transitions. Word has length 95 [2019-11-15 23:28:47,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:47,757 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 380 transitions. [2019-11-15 23:28:47,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:47,757 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 380 transitions. [2019-11-15 23:28:47,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 23:28:47,760 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:47,760 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:47,760 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:47,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:47,761 INFO L82 PathProgramCache]: Analyzing trace with hash 407531758, now seen corresponding path program 1 times [2019-11-15 23:28:47,761 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:47,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464361356] [2019-11-15 23:28:47,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:47,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:47,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:47,820 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:28:47,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464361356] [2019-11-15 23:28:47,822 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:47,822 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:47,823 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264937874] [2019-11-15 23:28:47,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:47,823 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:47,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:47,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:47,823 INFO L87 Difference]: Start difference. First operand 252 states and 380 transitions. Second operand 4 states. [2019-11-15 23:28:48,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:48,175 INFO L93 Difference]: Finished difference Result 538 states and 810 transitions. [2019-11-15 23:28:48,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:48,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 23:28:48,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:48,178 INFO L225 Difference]: With dead ends: 538 [2019-11-15 23:28:48,179 INFO L226 Difference]: Without dead ends: 305 [2019-11-15 23:28:48,179 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:48,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-15 23:28:48,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 252. [2019-11-15 23:28:48,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 23:28:48,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 379 transitions. [2019-11-15 23:28:48,186 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 379 transitions. Word has length 96 [2019-11-15 23:28:48,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:48,187 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 379 transitions. [2019-11-15 23:28:48,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:48,187 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 379 transitions. [2019-11-15 23:28:48,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 23:28:48,188 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:48,188 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:48,188 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:48,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:48,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1794317168, now seen corresponding path program 1 times [2019-11-15 23:28:48,189 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:48,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167697564] [2019-11-15 23:28:48,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:48,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:48,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:48,247 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:28:48,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167697564] [2019-11-15 23:28:48,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:48,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:48,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778847662] [2019-11-15 23:28:48,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:48,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:48,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:48,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:48,249 INFO L87 Difference]: Start difference. First operand 252 states and 379 transitions. Second operand 4 states. [2019-11-15 23:28:48,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:48,651 INFO L93 Difference]: Finished difference Result 506 states and 763 transitions. [2019-11-15 23:28:48,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:48,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 23:28:48,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:48,652 INFO L225 Difference]: With dead ends: 506 [2019-11-15 23:28:48,653 INFO L226 Difference]: Without dead ends: 273 [2019-11-15 23:28:48,653 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:48,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-15 23:28:48,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-11-15 23:28:48,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 23:28:48,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 378 transitions. [2019-11-15 23:28:48,660 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 378 transitions. Word has length 96 [2019-11-15 23:28:48,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:48,660 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 378 transitions. [2019-11-15 23:28:48,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:48,660 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 378 transitions. [2019-11-15 23:28:48,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 23:28:48,661 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:48,661 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:48,661 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:48,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:48,662 INFO L82 PathProgramCache]: Analyzing trace with hash -553515499, now seen corresponding path program 1 times [2019-11-15 23:28:48,662 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:48,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292726566] [2019-11-15 23:28:48,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:48,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:48,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:48,723 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:28:48,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292726566] [2019-11-15 23:28:48,724 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:48,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:48,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690209831] [2019-11-15 23:28:48,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:48,725 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:48,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:48,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:48,725 INFO L87 Difference]: Start difference. First operand 252 states and 378 transitions. Second operand 4 states. [2019-11-15 23:28:49,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:49,054 INFO L93 Difference]: Finished difference Result 538 states and 806 transitions. [2019-11-15 23:28:49,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:49,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 23:28:49,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:49,056 INFO L225 Difference]: With dead ends: 538 [2019-11-15 23:28:49,056 INFO L226 Difference]: Without dead ends: 305 [2019-11-15 23:28:49,057 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:49,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-15 23:28:49,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 252. [2019-11-15 23:28:49,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 23:28:49,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 377 transitions. [2019-11-15 23:28:49,064 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 377 transitions. Word has length 97 [2019-11-15 23:28:49,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:49,064 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 377 transitions. [2019-11-15 23:28:49,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:49,065 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 377 transitions. [2019-11-15 23:28:49,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 23:28:49,065 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:49,066 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:49,066 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:49,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:49,066 INFO L82 PathProgramCache]: Analyzing trace with hash -512840749, now seen corresponding path program 1 times [2019-11-15 23:28:49,066 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:49,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768319682] [2019-11-15 23:28:49,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:49,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:49,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:28:49,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768319682] [2019-11-15 23:28:49,137 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:49,137 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:49,137 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972334385] [2019-11-15 23:28:49,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:49,138 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:49,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:49,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:49,138 INFO L87 Difference]: Start difference. First operand 252 states and 377 transitions. Second operand 4 states. [2019-11-15 23:28:49,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:49,401 INFO L93 Difference]: Finished difference Result 506 states and 759 transitions. [2019-11-15 23:28:49,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:49,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 23:28:49,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:49,406 INFO L225 Difference]: With dead ends: 506 [2019-11-15 23:28:49,406 INFO L226 Difference]: Without dead ends: 273 [2019-11-15 23:28:49,406 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:49,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-15 23:28:49,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-11-15 23:28:49,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 23:28:49,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 376 transitions. [2019-11-15 23:28:49,413 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 376 transitions. Word has length 97 [2019-11-15 23:28:49,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:49,414 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 376 transitions. [2019-11-15 23:28:49,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:49,414 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 376 transitions. [2019-11-15 23:28:49,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 23:28:49,415 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:49,415 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:49,415 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:49,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:49,415 INFO L82 PathProgramCache]: Analyzing trace with hash 983553299, now seen corresponding path program 1 times [2019-11-15 23:28:49,415 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:49,416 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685474871] [2019-11-15 23:28:49,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:49,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:49,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:49,473 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:28:49,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685474871] [2019-11-15 23:28:49,474 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:49,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:49,474 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365897042] [2019-11-15 23:28:49,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:49,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:49,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:49,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:49,475 INFO L87 Difference]: Start difference. First operand 252 states and 376 transitions. Second operand 4 states. [2019-11-15 23:28:49,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:49,956 INFO L93 Difference]: Finished difference Result 538 states and 802 transitions. [2019-11-15 23:28:49,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:49,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 23:28:49,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:49,959 INFO L225 Difference]: With dead ends: 538 [2019-11-15 23:28:49,959 INFO L226 Difference]: Without dead ends: 305 [2019-11-15 23:28:49,959 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:49,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-15 23:28:49,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 252. [2019-11-15 23:28:49,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 23:28:49,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 375 transitions. [2019-11-15 23:28:49,967 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 375 transitions. Word has length 98 [2019-11-15 23:28:49,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:49,967 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 375 transitions. [2019-11-15 23:28:49,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:49,967 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 375 transitions. [2019-11-15 23:28:49,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 23:28:49,968 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:49,969 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:49,969 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:49,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:49,969 INFO L82 PathProgramCache]: Analyzing trace with hash -2050496747, now seen corresponding path program 1 times [2019-11-15 23:28:49,969 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:49,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823576455] [2019-11-15 23:28:49,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:49,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:49,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:50,028 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:28:50,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823576455] [2019-11-15 23:28:50,029 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:50,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:50,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963677581] [2019-11-15 23:28:50,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:50,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:50,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:50,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:50,030 INFO L87 Difference]: Start difference. First operand 252 states and 375 transitions. Second operand 4 states. [2019-11-15 23:28:50,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:50,429 INFO L93 Difference]: Finished difference Result 506 states and 755 transitions. [2019-11-15 23:28:50,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:50,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 23:28:50,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:50,431 INFO L225 Difference]: With dead ends: 506 [2019-11-15 23:28:50,431 INFO L226 Difference]: Without dead ends: 273 [2019-11-15 23:28:50,432 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:50,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-15 23:28:50,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-11-15 23:28:50,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 23:28:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 374 transitions. [2019-11-15 23:28:50,439 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 374 transitions. Word has length 98 [2019-11-15 23:28:50,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:50,439 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 374 transitions. [2019-11-15 23:28:50,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:50,439 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 374 transitions. [2019-11-15 23:28:50,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 23:28:50,440 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:50,440 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:50,441 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:50,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:50,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1642158822, now seen corresponding path program 1 times [2019-11-15 23:28:50,441 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:50,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840445095] [2019-11-15 23:28:50,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:50,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:50,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:28:50,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840445095] [2019-11-15 23:28:50,512 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:50,512 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:50,512 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257665814] [2019-11-15 23:28:50,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:50,513 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:50,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:50,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:50,513 INFO L87 Difference]: Start difference. First operand 252 states and 374 transitions. Second operand 4 states. [2019-11-15 23:28:50,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:50,891 INFO L93 Difference]: Finished difference Result 528 states and 786 transitions. [2019-11-15 23:28:50,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:50,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-15 23:28:50,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:50,893 INFO L225 Difference]: With dead ends: 528 [2019-11-15 23:28:50,893 INFO L226 Difference]: Without dead ends: 295 [2019-11-15 23:28:50,894 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:50,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-11-15 23:28:50,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 252. [2019-11-15 23:28:50,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 23:28:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 373 transitions. [2019-11-15 23:28:50,900 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 373 transitions. Word has length 99 [2019-11-15 23:28:50,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:50,901 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 373 transitions. [2019-11-15 23:28:50,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:50,901 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 373 transitions. [2019-11-15 23:28:50,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 23:28:50,902 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:50,902 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:50,902 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:50,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:50,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1208429736, now seen corresponding path program 1 times [2019-11-15 23:28:50,903 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:50,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495937808] [2019-11-15 23:28:50,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:50,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:50,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:28:50,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495937808] [2019-11-15 23:28:50,968 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:50,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:50,968 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085008155] [2019-11-15 23:28:50,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:50,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:50,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:50,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:50,970 INFO L87 Difference]: Start difference. First operand 252 states and 373 transitions. Second operand 4 states. [2019-11-15 23:28:51,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:51,256 INFO L93 Difference]: Finished difference Result 496 states and 739 transitions. [2019-11-15 23:28:51,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:51,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-15 23:28:51,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:51,258 INFO L225 Difference]: With dead ends: 496 [2019-11-15 23:28:51,258 INFO L226 Difference]: Without dead ends: 263 [2019-11-15 23:28:51,259 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:51,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-11-15 23:28:51,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 252. [2019-11-15 23:28:51,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 23:28:51,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 372 transitions. [2019-11-15 23:28:51,268 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 372 transitions. Word has length 99 [2019-11-15 23:28:51,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:51,268 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 372 transitions. [2019-11-15 23:28:51,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:51,268 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 372 transitions. [2019-11-15 23:28:51,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 23:28:51,269 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:51,270 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:51,270 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:51,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:51,270 INFO L82 PathProgramCache]: Analyzing trace with hash -232302130, now seen corresponding path program 1 times [2019-11-15 23:28:51,271 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:51,271 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729740477] [2019-11-15 23:28:51,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:51,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:51,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:51,340 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:28:51,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729740477] [2019-11-15 23:28:51,341 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:51,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:51,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997772767] [2019-11-15 23:28:51,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:51,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:51,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:51,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:51,342 INFO L87 Difference]: Start difference. First operand 252 states and 372 transitions. Second operand 4 states. [2019-11-15 23:28:51,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:51,823 INFO L93 Difference]: Finished difference Result 528 states and 782 transitions. [2019-11-15 23:28:51,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:51,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-15 23:28:51,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:51,825 INFO L225 Difference]: With dead ends: 528 [2019-11-15 23:28:51,825 INFO L226 Difference]: Without dead ends: 295 [2019-11-15 23:28:51,826 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:51,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-11-15 23:28:51,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 252. [2019-11-15 23:28:51,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 23:28:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 371 transitions. [2019-11-15 23:28:51,833 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 371 transitions. Word has length 103 [2019-11-15 23:28:51,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:51,834 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 371 transitions. [2019-11-15 23:28:51,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:51,834 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 371 transitions. [2019-11-15 23:28:51,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 23:28:51,835 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:51,835 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:51,835 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:51,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:51,836 INFO L82 PathProgramCache]: Analyzing trace with hash 446970124, now seen corresponding path program 1 times [2019-11-15 23:28:51,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:51,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723745268] [2019-11-15 23:28:51,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:51,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:51,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 23:28:51,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723745268] [2019-11-15 23:28:51,902 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:51,903 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:28:51,903 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337476014] [2019-11-15 23:28:51,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:28:51,903 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:51,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:28:51,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:28:51,904 INFO L87 Difference]: Start difference. First operand 252 states and 371 transitions. Second operand 3 states. [2019-11-15 23:28:51,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:51,949 INFO L93 Difference]: Finished difference Result 716 states and 1068 transitions. [2019-11-15 23:28:51,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:28:51,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-15 23:28:51,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:51,952 INFO L225 Difference]: With dead ends: 716 [2019-11-15 23:28:51,952 INFO L226 Difference]: Without dead ends: 483 [2019-11-15 23:28:51,953 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:28:51,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-11-15 23:28:51,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2019-11-15 23:28:51,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-11-15 23:28:51,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 714 transitions. [2019-11-15 23:28:51,966 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 714 transitions. Word has length 103 [2019-11-15 23:28:51,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:51,966 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 714 transitions. [2019-11-15 23:28:51,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:28:51,967 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 714 transitions. [2019-11-15 23:28:51,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-15 23:28:51,968 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:51,968 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:51,969 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:51,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:51,969 INFO L82 PathProgramCache]: Analyzing trace with hash -965755464, now seen corresponding path program 1 times [2019-11-15 23:28:51,969 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:51,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954021371] [2019-11-15 23:28:51,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:51,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:51,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:52,026 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 23:28:52,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954021371] [2019-11-15 23:28:52,027 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:52,027 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:28:52,027 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211009782] [2019-11-15 23:28:52,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:28:52,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:52,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:28:52,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:28:52,029 INFO L87 Difference]: Start difference. First operand 483 states and 714 transitions. Second operand 3 states. [2019-11-15 23:28:52,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:52,082 INFO L93 Difference]: Finished difference Result 1178 states and 1754 transitions. [2019-11-15 23:28:52,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:28:52,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-15 23:28:52,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:52,086 INFO L225 Difference]: With dead ends: 1178 [2019-11-15 23:28:52,086 INFO L226 Difference]: Without dead ends: 714 [2019-11-15 23:28:52,087 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:28:52,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-11-15 23:28:52,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2019-11-15 23:28:52,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-11-15 23:28:52,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1058 transitions. [2019-11-15 23:28:52,106 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1058 transitions. Word has length 122 [2019-11-15 23:28:52,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:52,107 INFO L462 AbstractCegarLoop]: Abstraction has 714 states and 1058 transitions. [2019-11-15 23:28:52,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:28:52,107 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1058 transitions. [2019-11-15 23:28:52,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-15 23:28:52,109 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:52,109 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:52,110 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:52,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:52,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1452035124, now seen corresponding path program 1 times [2019-11-15 23:28:52,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:52,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414091778] [2019-11-15 23:28:52,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:52,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:52,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:52,186 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-15 23:28:52,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414091778] [2019-11-15 23:28:52,187 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:52,187 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:28:52,187 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133451473] [2019-11-15 23:28:52,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:28:52,188 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:52,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:28:52,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:28:52,189 INFO L87 Difference]: Start difference. First operand 714 states and 1058 transitions. Second operand 3 states. [2019-11-15 23:28:52,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:52,267 INFO L93 Difference]: Finished difference Result 1635 states and 2435 transitions. [2019-11-15 23:28:52,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:28:52,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-11-15 23:28:52,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:52,272 INFO L225 Difference]: With dead ends: 1635 [2019-11-15 23:28:52,272 INFO L226 Difference]: Without dead ends: 940 [2019-11-15 23:28:52,273 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:28:52,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-11-15 23:28:52,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2019-11-15 23:28:52,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-11-15 23:28:52,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1392 transitions. [2019-11-15 23:28:52,300 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1392 transitions. Word has length 165 [2019-11-15 23:28:52,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:52,301 INFO L462 AbstractCegarLoop]: Abstraction has 940 states and 1392 transitions. [2019-11-15 23:28:52,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:28:52,301 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1392 transitions. [2019-11-15 23:28:52,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-15 23:28:52,303 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:52,304 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:52,304 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:52,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:52,304 INFO L82 PathProgramCache]: Analyzing trace with hash 962270157, now seen corresponding path program 1 times [2019-11-15 23:28:52,305 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:52,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591479785] [2019-11-15 23:28:52,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:52,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:52,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:52,402 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-11-15 23:28:52,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591479785] [2019-11-15 23:28:52,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:52,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:28:52,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905530840] [2019-11-15 23:28:52,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:28:52,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:52,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:28:52,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:28:52,404 INFO L87 Difference]: Start difference. First operand 940 states and 1392 transitions. Second operand 3 states. [2019-11-15 23:28:52,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:52,468 INFO L93 Difference]: Finished difference Result 2092 states and 3110 transitions. [2019-11-15 23:28:52,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:28:52,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-11-15 23:28:52,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:52,475 INFO L225 Difference]: With dead ends: 2092 [2019-11-15 23:28:52,475 INFO L226 Difference]: Without dead ends: 1171 [2019-11-15 23:28:52,477 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:28:52,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2019-11-15 23:28:52,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1171. [2019-11-15 23:28:52,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2019-11-15 23:28:52,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1738 transitions. [2019-11-15 23:28:52,509 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1738 transitions. Word has length 204 [2019-11-15 23:28:52,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:52,509 INFO L462 AbstractCegarLoop]: Abstraction has 1171 states and 1738 transitions. [2019-11-15 23:28:52,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:28:52,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1738 transitions. [2019-11-15 23:28:52,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-11-15 23:28:52,512 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:52,513 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:52,513 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:52,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:52,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1282881610, now seen corresponding path program 1 times [2019-11-15 23:28:52,514 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:52,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441441358] [2019-11-15 23:28:52,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:52,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:52,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:52,648 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2019-11-15 23:28:52,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441441358] [2019-11-15 23:28:52,649 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:52,649 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:28:52,650 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864856632] [2019-11-15 23:28:52,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:28:52,651 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:52,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:28:52,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:28:52,651 INFO L87 Difference]: Start difference. First operand 1171 states and 1738 transitions. Second operand 3 states. [2019-11-15 23:28:52,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:52,710 INFO L93 Difference]: Finished difference Result 1404 states and 2087 transitions. [2019-11-15 23:28:52,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:28:52,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-11-15 23:28:52,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:52,717 INFO L225 Difference]: With dead ends: 1404 [2019-11-15 23:28:52,717 INFO L226 Difference]: Without dead ends: 1402 [2019-11-15 23:28:52,718 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:28:52,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-11-15 23:28:52,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402. [2019-11-15 23:28:52,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2019-11-15 23:28:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2085 transitions. [2019-11-15 23:28:52,758 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2085 transitions. Word has length 246 [2019-11-15 23:28:52,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:52,759 INFO L462 AbstractCegarLoop]: Abstraction has 1402 states and 2085 transitions. [2019-11-15 23:28:52,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:28:52,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2085 transitions. [2019-11-15 23:28:52,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-11-15 23:28:52,763 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:52,764 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:52,765 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:52,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:52,765 INFO L82 PathProgramCache]: Analyzing trace with hash 72434664, now seen corresponding path program 1 times [2019-11-15 23:28:52,765 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:52,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842058914] [2019-11-15 23:28:52,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:52,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:52,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:52,999 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2019-11-15 23:28:53,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842058914] [2019-11-15 23:28:53,000 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:53,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:53,000 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957618491] [2019-11-15 23:28:53,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:53,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:53,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:53,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:53,002 INFO L87 Difference]: Start difference. First operand 1402 states and 2085 transitions. Second operand 4 states. [2019-11-15 23:28:53,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:53,613 INFO L93 Difference]: Finished difference Result 3390 states and 5071 transitions. [2019-11-15 23:28:53,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:53,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 290 [2019-11-15 23:28:53,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:53,624 INFO L225 Difference]: With dead ends: 3390 [2019-11-15 23:28:53,624 INFO L226 Difference]: Without dead ends: 2007 [2019-11-15 23:28:53,626 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:53,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2019-11-15 23:28:53,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 1648. [2019-11-15 23:28:53,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1648 states. [2019-11-15 23:28:53,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2535 transitions. [2019-11-15 23:28:53,674 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2535 transitions. Word has length 290 [2019-11-15 23:28:53,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:53,675 INFO L462 AbstractCegarLoop]: Abstraction has 1648 states and 2535 transitions. [2019-11-15 23:28:53,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:53,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2535 transitions. [2019-11-15 23:28:53,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-11-15 23:28:53,679 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:53,680 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:53,680 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:53,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:53,680 INFO L82 PathProgramCache]: Analyzing trace with hash -357223642, now seen corresponding path program 1 times [2019-11-15 23:28:53,680 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:53,681 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491546281] [2019-11-15 23:28:53,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:53,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:53,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:54,031 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-15 23:28:54,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491546281] [2019-11-15 23:28:54,031 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:54,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:28:54,032 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710860445] [2019-11-15 23:28:54,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:28:54,032 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:54,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:28:54,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:28:54,032 INFO L87 Difference]: Start difference. First operand 1648 states and 2535 transitions. Second operand 7 states. [2019-11-15 23:28:55,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:55,513 INFO L93 Difference]: Finished difference Result 5303 states and 8182 transitions. [2019-11-15 23:28:55,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:28:55,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 290 [2019-11-15 23:28:55,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:55,532 INFO L225 Difference]: With dead ends: 5303 [2019-11-15 23:28:55,532 INFO L226 Difference]: Without dead ends: 3674 [2019-11-15 23:28:55,535 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:28:55,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2019-11-15 23:28:55,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3312. [2019-11-15 23:28:55,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3312 states. [2019-11-15 23:28:55,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 5197 transitions. [2019-11-15 23:28:55,649 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 5197 transitions. Word has length 290 [2019-11-15 23:28:55,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:55,649 INFO L462 AbstractCegarLoop]: Abstraction has 3312 states and 5197 transitions. [2019-11-15 23:28:55,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:28:55,649 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 5197 transitions. [2019-11-15 23:28:55,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-11-15 23:28:55,658 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:55,659 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:55,659 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:55,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:55,659 INFO L82 PathProgramCache]: Analyzing trace with hash 2014493224, now seen corresponding path program 1 times [2019-11-15 23:28:55,660 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:55,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554689253] [2019-11-15 23:28:55,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:55,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:55,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:56,007 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 506 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2019-11-15 23:28:56,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554689253] [2019-11-15 23:28:56,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:56,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:28:56,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150246334] [2019-11-15 23:28:56,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:28:56,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:56,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:28:56,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:28:56,008 INFO L87 Difference]: Start difference. First operand 3312 states and 5197 transitions. Second operand 7 states. [2019-11-15 23:28:57,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:57,720 INFO L93 Difference]: Finished difference Result 11872 states and 18470 transitions. [2019-11-15 23:28:57,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:28:57,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 290 [2019-11-15 23:28:57,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:57,772 INFO L225 Difference]: With dead ends: 11872 [2019-11-15 23:28:57,772 INFO L226 Difference]: Without dead ends: 8579 [2019-11-15 23:28:57,777 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:28:57,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8579 states. [2019-11-15 23:28:57,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8579 to 4814. [2019-11-15 23:28:57,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4814 states. [2019-11-15 23:28:57,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4814 states to 4814 states and 7862 transitions. [2019-11-15 23:28:57,957 INFO L78 Accepts]: Start accepts. Automaton has 4814 states and 7862 transitions. Word has length 290 [2019-11-15 23:28:57,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:57,957 INFO L462 AbstractCegarLoop]: Abstraction has 4814 states and 7862 transitions. [2019-11-15 23:28:57,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:28:57,958 INFO L276 IsEmpty]: Start isEmpty. Operand 4814 states and 7862 transitions. [2019-11-15 23:28:57,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-11-15 23:28:57,967 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:57,968 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:57,968 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:57,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:57,968 INFO L82 PathProgramCache]: Analyzing trace with hash 514655940, now seen corresponding path program 1 times [2019-11-15 23:28:57,968 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:57,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281377859] [2019-11-15 23:28:57,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:57,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:57,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2019-11-15 23:28:58,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281377859] [2019-11-15 23:28:58,192 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:58,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:28:58,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975002063] [2019-11-15 23:28:58,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:28:58,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:58,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:28:58,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:28:58,193 INFO L87 Difference]: Start difference. First operand 4814 states and 7862 transitions. Second operand 4 states. [2019-11-15 23:28:58,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:28:58,853 INFO L93 Difference]: Finished difference Result 10343 states and 16659 transitions. [2019-11-15 23:28:58,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:28:58,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 291 [2019-11-15 23:28:58,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:28:58,865 INFO L225 Difference]: With dead ends: 10343 [2019-11-15 23:28:58,865 INFO L226 Difference]: Without dead ends: 5548 [2019-11-15 23:28:58,870 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:28:58,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2019-11-15 23:28:58,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 4826. [2019-11-15 23:28:58,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4826 states. [2019-11-15 23:28:59,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4826 states to 4826 states and 7874 transitions. [2019-11-15 23:28:59,000 INFO L78 Accepts]: Start accepts. Automaton has 4826 states and 7874 transitions. Word has length 291 [2019-11-15 23:28:59,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:28:59,001 INFO L462 AbstractCegarLoop]: Abstraction has 4826 states and 7874 transitions. [2019-11-15 23:28:59,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:28:59,001 INFO L276 IsEmpty]: Start isEmpty. Operand 4826 states and 7874 transitions. [2019-11-15 23:28:59,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-11-15 23:28:59,011 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:28:59,011 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:28:59,011 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:28:59,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:59,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1932810758, now seen corresponding path program 1 times [2019-11-15 23:28:59,012 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:28:59,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258433549] [2019-11-15 23:28:59,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:59,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:28:59,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:28:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:59,305 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 510 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2019-11-15 23:28:59,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258433549] [2019-11-15 23:28:59,306 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:28:59,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:28:59,306 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321299610] [2019-11-15 23:28:59,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:28:59,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:28:59,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:28:59,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:28:59,307 INFO L87 Difference]: Start difference. First operand 4826 states and 7874 transitions. Second operand 7 states. [2019-11-15 23:29:00,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:29:00,847 INFO L93 Difference]: Finished difference Result 11133 states and 17599 transitions. [2019-11-15 23:29:00,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:29:00,847 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 291 [2019-11-15 23:29:00,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:29:00,861 INFO L225 Difference]: With dead ends: 11133 [2019-11-15 23:29:00,861 INFO L226 Difference]: Without dead ends: 6326 [2019-11-15 23:29:00,868 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:29:00,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6326 states. [2019-11-15 23:29:01,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6326 to 3810. [2019-11-15 23:29:01,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3810 states. [2019-11-15 23:29:01,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3810 states to 3810 states and 6043 transitions. [2019-11-15 23:29:01,049 INFO L78 Accepts]: Start accepts. Automaton has 3810 states and 6043 transitions. Word has length 291 [2019-11-15 23:29:01,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:29:01,050 INFO L462 AbstractCegarLoop]: Abstraction has 3810 states and 6043 transitions. [2019-11-15 23:29:01,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:29:01,050 INFO L276 IsEmpty]: Start isEmpty. Operand 3810 states and 6043 transitions. [2019-11-15 23:29:01,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-11-15 23:29:01,057 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:29:01,057 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:29:01,057 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:29:01,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:29:01,058 INFO L82 PathProgramCache]: Analyzing trace with hash 850632484, now seen corresponding path program 1 times [2019-11-15 23:29:01,058 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:29:01,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369908783] [2019-11-15 23:29:01,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:01,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:01,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:29:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:29:01,296 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 516 proven. 92 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-11-15 23:29:01,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369908783] [2019-11-15 23:29:01,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825437574] [2019-11-15 23:29:01,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:29:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:29:01,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:29:01,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:29:01,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-15 23:29:01,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:01,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:01,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:29:01,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 23:29:01,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2019-11-15 23:29:01,712 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:29:01,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:01,720 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 38 [2019-11-15 23:29:01,721 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:29:01,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:01,802 INFO L341 Elim1Store]: treesize reduction 59, result has 52.0 percent of original size [2019-11-15 23:29:01,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 73 [2019-11-15 23:29:01,803 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:01,853 INFO L567 ElimStorePlain]: treesize reduction 22, result has 69.9 percent of original size [2019-11-15 23:29:01,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:29:01,856 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:19 [2019-11-15 23:29:01,885 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 23:29:01,885 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 23:29:01,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:01,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:01,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:29:01,895 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 23:29:02,042 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 505 proven. 28 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-15 23:29:02,043 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:29:02,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-11-15 23:29:02,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631524996] [2019-11-15 23:29:02,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 23:29:02,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:29:02,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:29:02,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:29:02,046 INFO L87 Difference]: Start difference. First operand 3810 states and 6043 transitions. Second operand 11 states. [2019-11-15 23:29:04,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:29:04,439 INFO L93 Difference]: Finished difference Result 11029 states and 17372 transitions. [2019-11-15 23:29:04,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 23:29:04,440 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 303 [2019-11-15 23:29:04,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:29:04,455 INFO L225 Difference]: With dead ends: 11029 [2019-11-15 23:29:04,456 INFO L226 Difference]: Without dead ends: 7238 [2019-11-15 23:29:04,461 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 301 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:29:04,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7238 states. [2019-11-15 23:29:04,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7238 to 4938. [2019-11-15 23:29:04,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4938 states. [2019-11-15 23:29:04,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4938 states to 4938 states and 8107 transitions. [2019-11-15 23:29:04,632 INFO L78 Accepts]: Start accepts. Automaton has 4938 states and 8107 transitions. Word has length 303 [2019-11-15 23:29:04,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:29:04,633 INFO L462 AbstractCegarLoop]: Abstraction has 4938 states and 8107 transitions. [2019-11-15 23:29:04,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 23:29:04,633 INFO L276 IsEmpty]: Start isEmpty. Operand 4938 states and 8107 transitions. [2019-11-15 23:29:04,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-15 23:29:04,643 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:29:04,645 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:29:04,858 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:29:04,859 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:29:04,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:29:04,859 INFO L82 PathProgramCache]: Analyzing trace with hash 944420676, now seen corresponding path program 1 times [2019-11-15 23:29:04,860 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:29:04,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439365318] [2019-11-15 23:29:04,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:04,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:04,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:29:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:29:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 538 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2019-11-15 23:29:05,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439365318] [2019-11-15 23:29:05,200 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:29:05,200 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:29:05,200 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955364791] [2019-11-15 23:29:05,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:29:05,201 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:29:05,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:29:05,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:29:05,202 INFO L87 Difference]: Start difference. First operand 4938 states and 8107 transitions. Second operand 7 states. [2019-11-15 23:29:07,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:29:07,017 INFO L93 Difference]: Finished difference Result 13678 states and 21688 transitions. [2019-11-15 23:29:07,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:29:07,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 305 [2019-11-15 23:29:07,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:29:07,038 INFO L225 Difference]: With dead ends: 13678 [2019-11-15 23:29:07,038 INFO L226 Difference]: Without dead ends: 8759 [2019-11-15 23:29:07,044 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:29:07,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8759 states. [2019-11-15 23:29:07,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8759 to 5598. [2019-11-15 23:29:07,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5598 states. [2019-11-15 23:29:07,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5598 states to 5598 states and 9259 transitions. [2019-11-15 23:29:07,273 INFO L78 Accepts]: Start accepts. Automaton has 5598 states and 9259 transitions. Word has length 305 [2019-11-15 23:29:07,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:29:07,274 INFO L462 AbstractCegarLoop]: Abstraction has 5598 states and 9259 transitions. [2019-11-15 23:29:07,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:29:07,274 INFO L276 IsEmpty]: Start isEmpty. Operand 5598 states and 9259 transitions. [2019-11-15 23:29:07,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-11-15 23:29:07,284 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:29:07,287 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:29:07,288 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:29:07,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:29:07,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1394112060, now seen corresponding path program 1 times [2019-11-15 23:29:07,288 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:29:07,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798036579] [2019-11-15 23:29:07,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:07,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:07,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:29:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:29:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 466 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2019-11-15 23:29:07,509 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798036579] [2019-11-15 23:29:07,509 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:29:07,509 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:29:07,509 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031090105] [2019-11-15 23:29:07,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:29:07,510 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:29:07,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:29:07,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:29:07,511 INFO L87 Difference]: Start difference. First operand 5598 states and 9259 transitions. Second operand 4 states. [2019-11-15 23:29:08,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:29:08,209 INFO L93 Difference]: Finished difference Result 11717 states and 19200 transitions. [2019-11-15 23:29:08,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:29:08,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2019-11-15 23:29:08,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:29:08,219 INFO L225 Difference]: With dead ends: 11717 [2019-11-15 23:29:08,219 INFO L226 Difference]: Without dead ends: 6138 [2019-11-15 23:29:08,225 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:29:08,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6138 states. [2019-11-15 23:29:08,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6138 to 5598. [2019-11-15 23:29:08,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5598 states. [2019-11-15 23:29:08,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5598 states to 5598 states and 9247 transitions. [2019-11-15 23:29:08,385 INFO L78 Accepts]: Start accepts. Automaton has 5598 states and 9247 transitions. Word has length 306 [2019-11-15 23:29:08,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:29:08,385 INFO L462 AbstractCegarLoop]: Abstraction has 5598 states and 9247 transitions. [2019-11-15 23:29:08,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:29:08,386 INFO L276 IsEmpty]: Start isEmpty. Operand 5598 states and 9247 transitions. [2019-11-15 23:29:08,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-11-15 23:29:08,393 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:29:08,394 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:29:08,401 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:29:08,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:29:08,402 INFO L82 PathProgramCache]: Analyzing trace with hash 582959980, now seen corresponding path program 1 times [2019-11-15 23:29:08,402 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:29:08,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756161038] [2019-11-15 23:29:08,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:08,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:08,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:29:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:29:08,677 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 538 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-11-15 23:29:08,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756161038] [2019-11-15 23:29:08,677 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:29:08,678 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:29:08,678 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836866619] [2019-11-15 23:29:08,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:29:08,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:29:08,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:29:08,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:29:08,679 INFO L87 Difference]: Start difference. First operand 5598 states and 9247 transitions. Second operand 5 states. [2019-11-15 23:29:09,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:29:09,332 INFO L93 Difference]: Finished difference Result 11983 states and 19574 transitions. [2019-11-15 23:29:09,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:29:09,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 306 [2019-11-15 23:29:09,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:29:09,337 INFO L225 Difference]: With dead ends: 11983 [2019-11-15 23:29:09,337 INFO L226 Difference]: Without dead ends: 6404 [2019-11-15 23:29:09,341 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:29:09,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6404 states. [2019-11-15 23:29:09,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6404 to 5118. [2019-11-15 23:29:09,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5118 states. [2019-11-15 23:29:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5118 states to 5118 states and 8371 transitions. [2019-11-15 23:29:09,507 INFO L78 Accepts]: Start accepts. Automaton has 5118 states and 8371 transitions. Word has length 306 [2019-11-15 23:29:09,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:29:09,508 INFO L462 AbstractCegarLoop]: Abstraction has 5118 states and 8371 transitions. [2019-11-15 23:29:09,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:29:09,508 INFO L276 IsEmpty]: Start isEmpty. Operand 5118 states and 8371 transitions. [2019-11-15 23:29:09,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-15 23:29:09,515 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:29:09,516 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:29:09,516 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:29:09,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:29:09,516 INFO L82 PathProgramCache]: Analyzing trace with hash 102325851, now seen corresponding path program 1 times [2019-11-15 23:29:09,516 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:29:09,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423437252] [2019-11-15 23:29:09,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:09,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:09,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:29:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:29:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2019-11-15 23:29:09,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423437252] [2019-11-15 23:29:09,747 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:29:09,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:29:09,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128608233] [2019-11-15 23:29:09,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:29:09,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:29:09,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:29:09,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:29:09,748 INFO L87 Difference]: Start difference. First operand 5118 states and 8371 transitions. Second operand 4 states. [2019-11-15 23:29:10,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:29:10,246 INFO L93 Difference]: Finished difference Result 10757 states and 17424 transitions. [2019-11-15 23:29:10,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:29:10,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 307 [2019-11-15 23:29:10,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:29:10,251 INFO L225 Difference]: With dead ends: 10757 [2019-11-15 23:29:10,251 INFO L226 Difference]: Without dead ends: 5658 [2019-11-15 23:29:10,255 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:29:10,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5658 states. [2019-11-15 23:29:10,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5658 to 5118. [2019-11-15 23:29:10,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5118 states. [2019-11-15 23:29:10,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5118 states to 5118 states and 8359 transitions. [2019-11-15 23:29:10,410 INFO L78 Accepts]: Start accepts. Automaton has 5118 states and 8359 transitions. Word has length 307 [2019-11-15 23:29:10,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:29:10,411 INFO L462 AbstractCegarLoop]: Abstraction has 5118 states and 8359 transitions. [2019-11-15 23:29:10,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:29:10,411 INFO L276 IsEmpty]: Start isEmpty. Operand 5118 states and 8359 transitions. [2019-11-15 23:29:10,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-11-15 23:29:10,418 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:29:10,418 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:29:10,418 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:29:10,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:29:10,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1646110655, now seen corresponding path program 1 times [2019-11-15 23:29:10,419 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:29:10,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062003746] [2019-11-15 23:29:10,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:10,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:10,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:29:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:29:10,570 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2019-11-15 23:29:10,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062003746] [2019-11-15 23:29:10,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:29:10,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:29:10,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139779433] [2019-11-15 23:29:10,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:29:10,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:29:10,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:29:10,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:29:10,572 INFO L87 Difference]: Start difference. First operand 5118 states and 8359 transitions. Second operand 4 states. [2019-11-15 23:29:11,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:29:11,306 INFO L93 Difference]: Finished difference Result 10757 states and 17400 transitions. [2019-11-15 23:29:11,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:29:11,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-11-15 23:29:11,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:29:11,310 INFO L225 Difference]: With dead ends: 10757 [2019-11-15 23:29:11,310 INFO L226 Difference]: Without dead ends: 5658 [2019-11-15 23:29:11,314 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:29:11,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5658 states. [2019-11-15 23:29:11,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5658 to 5118. [2019-11-15 23:29:11,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5118 states. [2019-11-15 23:29:11,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5118 states to 5118 states and 8347 transitions. [2019-11-15 23:29:11,438 INFO L78 Accepts]: Start accepts. Automaton has 5118 states and 8347 transitions. Word has length 308 [2019-11-15 23:29:11,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:29:11,439 INFO L462 AbstractCegarLoop]: Abstraction has 5118 states and 8347 transitions. [2019-11-15 23:29:11,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:29:11,439 INFO L276 IsEmpty]: Start isEmpty. Operand 5118 states and 8347 transitions. [2019-11-15 23:29:11,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-11-15 23:29:11,444 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:29:11,444 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:29:11,445 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:29:11,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:29:11,445 INFO L82 PathProgramCache]: Analyzing trace with hash 362681846, now seen corresponding path program 1 times [2019-11-15 23:29:11,445 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:29:11,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853288399] [2019-11-15 23:29:11,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:11,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:11,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:29:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:29:11,587 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 490 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2019-11-15 23:29:11,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853288399] [2019-11-15 23:29:11,587 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:29:11,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:29:11,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353191789] [2019-11-15 23:29:11,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:29:11,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:29:11,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:29:11,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:29:11,589 INFO L87 Difference]: Start difference. First operand 5118 states and 8347 transitions. Second operand 4 states. [2019-11-15 23:29:12,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:29:12,055 INFO L93 Difference]: Finished difference Result 10697 states and 17304 transitions. [2019-11-15 23:29:12,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:29:12,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2019-11-15 23:29:12,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:29:12,060 INFO L225 Difference]: With dead ends: 10697 [2019-11-15 23:29:12,060 INFO L226 Difference]: Without dead ends: 5598 [2019-11-15 23:29:12,063 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:29:12,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5598 states. [2019-11-15 23:29:12,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5598 to 5118. [2019-11-15 23:29:12,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5118 states. [2019-11-15 23:29:12,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5118 states to 5118 states and 8335 transitions. [2019-11-15 23:29:12,205 INFO L78 Accepts]: Start accepts. Automaton has 5118 states and 8335 transitions. Word has length 309 [2019-11-15 23:29:12,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:29:12,205 INFO L462 AbstractCegarLoop]: Abstraction has 5118 states and 8335 transitions. [2019-11-15 23:29:12,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:29:12,206 INFO L276 IsEmpty]: Start isEmpty. Operand 5118 states and 8335 transitions. [2019-11-15 23:29:12,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-11-15 23:29:12,212 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:29:12,213 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:29:12,213 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:29:12,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:29:12,213 INFO L82 PathProgramCache]: Analyzing trace with hash 305172060, now seen corresponding path program 1 times [2019-11-15 23:29:12,214 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:29:12,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971262168] [2019-11-15 23:29:12,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:12,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:12,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:29:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:29:12,454 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 547 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-11-15 23:29:12,454 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971262168] [2019-11-15 23:29:12,454 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:29:12,455 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:29:12,455 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240048710] [2019-11-15 23:29:12,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:29:12,455 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:29:12,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:29:12,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:29:12,456 INFO L87 Difference]: Start difference. First operand 5118 states and 8335 transitions. Second operand 4 states. [2019-11-15 23:29:12,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:29:12,936 INFO L93 Difference]: Finished difference Result 10697 states and 17280 transitions. [2019-11-15 23:29:12,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:29:12,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2019-11-15 23:29:12,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:29:12,941 INFO L225 Difference]: With dead ends: 10697 [2019-11-15 23:29:12,941 INFO L226 Difference]: Without dead ends: 5598 [2019-11-15 23:29:12,945 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:29:12,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5598 states. [2019-11-15 23:29:13,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5598 to 5118. [2019-11-15 23:29:13,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5118 states. [2019-11-15 23:29:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5118 states to 5118 states and 8323 transitions. [2019-11-15 23:29:13,051 INFO L78 Accepts]: Start accepts. Automaton has 5118 states and 8323 transitions. Word has length 312 [2019-11-15 23:29:13,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:29:13,051 INFO L462 AbstractCegarLoop]: Abstraction has 5118 states and 8323 transitions. [2019-11-15 23:29:13,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:29:13,051 INFO L276 IsEmpty]: Start isEmpty. Operand 5118 states and 8323 transitions. [2019-11-15 23:29:13,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-11-15 23:29:13,057 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:29:13,057 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:29:13,057 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:29:13,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:29:13,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1283111277, now seen corresponding path program 1 times [2019-11-15 23:29:13,057 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:29:13,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573619776] [2019-11-15 23:29:13,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:13,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:13,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:29:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:29:13,218 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 553 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-11-15 23:29:13,219 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573619776] [2019-11-15 23:29:13,219 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:29:13,219 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:29:13,219 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936442895] [2019-11-15 23:29:13,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:29:13,220 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:29:13,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:29:13,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:29:13,220 INFO L87 Difference]: Start difference. First operand 5118 states and 8323 transitions. Second operand 4 states. [2019-11-15 23:29:13,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:29:13,659 INFO L93 Difference]: Finished difference Result 10649 states and 17186 transitions. [2019-11-15 23:29:13,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:29:13,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 313 [2019-11-15 23:29:13,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:29:13,664 INFO L225 Difference]: With dead ends: 10649 [2019-11-15 23:29:13,664 INFO L226 Difference]: Without dead ends: 5550 [2019-11-15 23:29:13,668 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:29:13,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5550 states. [2019-11-15 23:29:13,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5550 to 5118. [2019-11-15 23:29:13,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5118 states. [2019-11-15 23:29:13,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5118 states to 5118 states and 8311 transitions. [2019-11-15 23:29:13,814 INFO L78 Accepts]: Start accepts. Automaton has 5118 states and 8311 transitions. Word has length 313 [2019-11-15 23:29:13,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:29:13,814 INFO L462 AbstractCegarLoop]: Abstraction has 5118 states and 8311 transitions. [2019-11-15 23:29:13,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:29:13,814 INFO L276 IsEmpty]: Start isEmpty. Operand 5118 states and 8311 transitions. [2019-11-15 23:29:13,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-11-15 23:29:13,817 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:29:13,818 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:29:13,818 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:29:13,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:29:13,818 INFO L82 PathProgramCache]: Analyzing trace with hash -261861566, now seen corresponding path program 1 times [2019-11-15 23:29:13,818 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:29:13,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063615501] [2019-11-15 23:29:13,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:13,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:13,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:29:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:29:13,958 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 512 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-11-15 23:29:13,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063615501] [2019-11-15 23:29:13,959 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:29:13,959 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:29:13,959 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076269781] [2019-11-15 23:29:13,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:29:13,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:29:13,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:29:13,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:29:13,960 INFO L87 Difference]: Start difference. First operand 5118 states and 8311 transitions. Second operand 4 states. [2019-11-15 23:29:14,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:29:14,446 INFO L93 Difference]: Finished difference Result 10781 states and 17472 transitions. [2019-11-15 23:29:14,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:29:14,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 313 [2019-11-15 23:29:14,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:29:14,450 INFO L225 Difference]: With dead ends: 10781 [2019-11-15 23:29:14,451 INFO L226 Difference]: Without dead ends: 5682 [2019-11-15 23:29:14,453 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:29:14,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5682 states. [2019-11-15 23:29:14,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5682 to 5430. [2019-11-15 23:29:14,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5430 states. [2019-11-15 23:29:14,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5430 states to 5430 states and 8851 transitions. [2019-11-15 23:29:14,570 INFO L78 Accepts]: Start accepts. Automaton has 5430 states and 8851 transitions. Word has length 313 [2019-11-15 23:29:14,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:29:14,570 INFO L462 AbstractCegarLoop]: Abstraction has 5430 states and 8851 transitions. [2019-11-15 23:29:14,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:29:14,570 INFO L276 IsEmpty]: Start isEmpty. Operand 5430 states and 8851 transitions. [2019-11-15 23:29:14,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-11-15 23:29:14,574 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:29:14,574 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:29:14,574 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:29:14,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:29:14,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1517486763, now seen corresponding path program 1 times [2019-11-15 23:29:14,574 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:29:14,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450907126] [2019-11-15 23:29:14,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:14,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:14,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:29:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:29:14,792 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 532 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-11-15 23:29:14,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450907126] [2019-11-15 23:29:14,793 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:29:14,793 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:29:14,793 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568075979] [2019-11-15 23:29:14,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:29:14,794 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:29:14,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:29:14,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:29:14,794 INFO L87 Difference]: Start difference. First operand 5430 states and 8851 transitions. Second operand 4 states. [2019-11-15 23:29:15,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:29:15,211 INFO L93 Difference]: Finished difference Result 11237 states and 18290 transitions. [2019-11-15 23:29:15,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:29:15,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 316 [2019-11-15 23:29:15,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:29:15,216 INFO L225 Difference]: With dead ends: 11237 [2019-11-15 23:29:15,216 INFO L226 Difference]: Without dead ends: 5826 [2019-11-15 23:29:15,218 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:29:15,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5826 states. [2019-11-15 23:29:15,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5826 to 5610. [2019-11-15 23:29:15,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5610 states. [2019-11-15 23:29:15,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5610 states to 5610 states and 9169 transitions. [2019-11-15 23:29:15,374 INFO L78 Accepts]: Start accepts. Automaton has 5610 states and 9169 transitions. Word has length 316 [2019-11-15 23:29:15,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:29:15,374 INFO L462 AbstractCegarLoop]: Abstraction has 5610 states and 9169 transitions. [2019-11-15 23:29:15,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:29:15,374 INFO L276 IsEmpty]: Start isEmpty. Operand 5610 states and 9169 transitions. [2019-11-15 23:29:15,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-11-15 23:29:15,377 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:29:15,378 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:29:15,378 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:29:15,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:29:15,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1980926243, now seen corresponding path program 1 times [2019-11-15 23:29:15,378 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:29:15,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215858759] [2019-11-15 23:29:15,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:15,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:15,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:29:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:29:15,674 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 671 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-11-15 23:29:15,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215858759] [2019-11-15 23:29:15,675 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:29:15,675 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:29:15,675 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56157583] [2019-11-15 23:29:15,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:29:15,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:29:15,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:29:15,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:29:15,676 INFO L87 Difference]: Start difference. First operand 5610 states and 9169 transitions. Second operand 5 states. [2019-11-15 23:29:16,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:29:16,384 INFO L93 Difference]: Finished difference Result 13743 states and 22430 transitions. [2019-11-15 23:29:16,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:29:16,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 319 [2019-11-15 23:29:16,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:29:16,389 INFO L225 Difference]: With dead ends: 13743 [2019-11-15 23:29:16,390 INFO L226 Difference]: Without dead ends: 8152 [2019-11-15 23:29:16,392 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:29:16,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8152 states. [2019-11-15 23:29:16,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8152 to 5406. [2019-11-15 23:29:16,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5406 states. [2019-11-15 23:29:16,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5406 states to 5406 states and 8809 transitions. [2019-11-15 23:29:16,533 INFO L78 Accepts]: Start accepts. Automaton has 5406 states and 8809 transitions. Word has length 319 [2019-11-15 23:29:16,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:29:16,534 INFO L462 AbstractCegarLoop]: Abstraction has 5406 states and 8809 transitions. [2019-11-15 23:29:16,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:29:16,534 INFO L276 IsEmpty]: Start isEmpty. Operand 5406 states and 8809 transitions. [2019-11-15 23:29:16,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-11-15 23:29:16,538 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:29:16,538 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:29:16,538 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:29:16,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:29:16,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1893458679, now seen corresponding path program 1 times [2019-11-15 23:29:16,539 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:29:16,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109346570] [2019-11-15 23:29:16,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:16,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:16,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:29:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:29:16,713 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 522 proven. 0 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2019-11-15 23:29:16,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109346570] [2019-11-15 23:29:16,713 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:29:16,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:29:16,714 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728594846] [2019-11-15 23:29:16,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:29:16,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:29:16,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:29:16,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:29:16,715 INFO L87 Difference]: Start difference. First operand 5406 states and 8809 transitions. Second operand 4 states. [2019-11-15 23:29:17,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:29:17,175 INFO L93 Difference]: Finished difference Result 11477 states and 18672 transitions. [2019-11-15 23:29:17,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:29:17,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 319 [2019-11-15 23:29:17,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:29:17,181 INFO L225 Difference]: With dead ends: 11477 [2019-11-15 23:29:17,181 INFO L226 Difference]: Without dead ends: 6090 [2019-11-15 23:29:17,184 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:29:17,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6090 states. [2019-11-15 23:29:17,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6090 to 5742. [2019-11-15 23:29:17,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5742 states. [2019-11-15 23:29:17,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5742 states to 5742 states and 9397 transitions. [2019-11-15 23:29:17,429 INFO L78 Accepts]: Start accepts. Automaton has 5742 states and 9397 transitions. Word has length 319 [2019-11-15 23:29:17,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:29:17,430 INFO L462 AbstractCegarLoop]: Abstraction has 5742 states and 9397 transitions. [2019-11-15 23:29:17,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:29:17,430 INFO L276 IsEmpty]: Start isEmpty. Operand 5742 states and 9397 transitions. [2019-11-15 23:29:17,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-11-15 23:29:17,433 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:29:17,434 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:29:17,434 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:29:17,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:29:17,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1907341665, now seen corresponding path program 1 times [2019-11-15 23:29:17,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:29:17,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075267189] [2019-11-15 23:29:17,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:17,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:29:17,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:29:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:29:19,257 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-11-15 23:29:19,421 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-11-15 23:29:20,262 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 199 proven. 695 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:29:20,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075267189] [2019-11-15 23:29:20,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231428478] [2019-11-15 23:29:20,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:29:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:29:20,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-15 23:29:20,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:29:20,570 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_160|, |v_#memory_$Pointer$.base_160|], 6=[|v_#memory_int_179|]} [2019-11-15 23:29:20,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:20,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2019-11-15 23:29:20,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:20,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:20,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:20,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2019-11-15 23:29:20,594 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:20,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:20,626 INFO L341 Elim1Store]: treesize reduction 70, result has 41.7 percent of original size [2019-11-15 23:29:20,626 INFO L375 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 41 treesize of output 62 [2019-11-15 23:29:20,627 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:20,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:20,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:29:20,637 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:79, output treesize:62 [2019-11-15 23:29:21,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:21,658 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_161|, |v_#memory_$Pointer$.base_161|], 12=[|v_#memory_int_180|]} [2019-11-15 23:29:21,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:21,668 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 91 [2019-11-15 23:29:21,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:21,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:21,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 87 [2019-11-15 23:29:21,684 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:21,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:21,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:21,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 74 [2019-11-15 23:29:21,730 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:21,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:21,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 66 [2019-11-15 23:29:21,737 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:21,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:21,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:21,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 59 [2019-11-15 23:29:21,794 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:21,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:21,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:21,812 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:21,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 89 [2019-11-15 23:29:21,814 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:21,842 INFO L567 ElimStorePlain]: treesize reduction 97, result has 29.2 percent of original size [2019-11-15 23:29:21,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:29:21,843 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:217, output treesize:40 [2019-11-15 23:29:21,886 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_162|, |v_#memory_$Pointer$.base_162|], 12=[|v_#memory_int_181|]} [2019-11-15 23:29:21,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:21,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2019-11-15 23:29:21,893 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:21,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:21,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:21,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2019-11-15 23:29:21,910 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:21,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:21,970 INFO L341 Elim1Store]: treesize reduction 120, result has 47.8 percent of original size [2019-11-15 23:29:21,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 128 [2019-11-15 23:29:21,971 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:21,999 INFO L567 ElimStorePlain]: treesize reduction 46, result has 61.3 percent of original size [2019-11-15 23:29:21,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:29:21,999 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:91, output treesize:73 [2019-11-15 23:29:22,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,063 INFO L392 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_163|, |v_#memory_$Pointer$.base_163|], 20=[|v_#memory_int_182|]} [2019-11-15 23:29:22,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:22,197 INFO L341 Elim1Store]: treesize reduction 54, result has 74.3 percent of original size [2019-11-15 23:29:22,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 196 treesize of output 295 [2019-11-15 23:29:22,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,227 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:29:22,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:22,397 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-11-15 23:29:22,397 INFO L341 Elim1Store]: treesize reduction 54, result has 71.6 percent of original size [2019-11-15 23:29:22,398 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 195 treesize of output 274 [2019-11-15 23:29:22,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:29:22,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:29:22,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:29:22,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:29:22,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:22,414 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:24,615 WARN L191 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 209 DAG size of output: 142 [2019-11-15 23:29:24,615 INFO L567 ElimStorePlain]: treesize reduction 3893, result has 22.5 percent of original size [2019-11-15 23:29:24,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:24,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:24,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:24,743 INFO L341 Elim1Store]: treesize reduction 46, result has 76.2 percent of original size [2019-11-15 23:29:24,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 321 treesize of output 363 [2019-11-15 23:29:24,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:24,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:24,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:24,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:24,816 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_2], 1=[v_arrayElimArr_1], 3=[v_arrayElimArr_2]} [2019-11-15 23:29:24,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:24,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:24,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:24,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 216 [2019-11-15 23:29:24,840 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:25,126 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 101 [2019-11-15 23:29:25,126 INFO L567 ElimStorePlain]: treesize reduction 274, result has 65.1 percent of original size [2019-11-15 23:29:25,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:25,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:25,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:25,213 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:25,213 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 242 treesize of output 226 [2019-11-15 23:29:25,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:25,214 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:25,321 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-15 23:29:25,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:25,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:25,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:25,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:25,435 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:25,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 150 [2019-11-15 23:29:25,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:29:25,436 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:25,568 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-11-15 23:29:25,569 INFO L567 ElimStorePlain]: treesize reduction 125, result has 68.4 percent of original size [2019-11-15 23:29:25,569 INFO L496 ElimStorePlain]: Start of recursive call 4: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:29:25,770 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:29:25,770 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no XNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:244) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 23:29:25,776 INFO L168 Benchmark]: Toolchain (without parser) took 53982.69 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 939.4 MB in the beginning and 1.9 GB in the end (delta: -993.4 MB). Peak memory consumption was 403.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:29:25,776 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:29:25,776 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:29:25,777 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:29:25,777 INFO L168 Benchmark]: Boogie Preprocessor took 92.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:29:25,777 INFO L168 Benchmark]: RCFGBuilder took 1130.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 980.0 MB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:29:25,777 INFO L168 Benchmark]: TraceAbstraction took 51842.48 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 980.0 MB in the beginning and 1.9 GB in the end (delta: -952.7 MB). Peak memory consumption was 327.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:29:25,779 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 804.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 105.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 92.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1130.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 980.0 MB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 51842.48 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 980.0 MB in the beginning and 1.9 GB in the end (delta: -952.7 MB). Peak memory consumption was 327.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no XNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no XNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:244) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 23:29:27,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:29:27,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:29:27,970 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:29:27,971 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:29:27,972 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:29:27,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:29:27,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:29:27,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:29:27,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:29:27,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:29:27,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:29:27,990 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:29:27,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:29:27,994 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:29:27,996 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:29:27,997 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:29:28,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:29:28,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:29:28,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:29:28,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:29:28,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:29:28,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:29:28,016 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:29:28,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:29:28,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:29:28,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:29:28,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:29:28,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:29:28,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:29:28,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:29:28,028 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:29:28,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:29:28,031 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:29:28,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:29:28,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:29:28,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:29:28,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:29:28,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:29:28,035 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:29:28,036 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:29:28,037 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 23:29:28,066 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:29:28,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:29:28,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:29:28,078 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:29:28,078 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:29:28,079 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:29:28,079 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:29:28,079 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:29:28,079 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:29:28,080 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:29:28,080 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:29:28,080 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:29:28,080 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 23:29:28,080 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 23:29:28,081 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:29:28,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:29:28,081 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:29:28,081 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:29:28,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:29:28,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:29:28,082 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:29:28,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:29:28,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:29:28,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:29:28,083 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:29:28,083 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:29:28,083 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 23:29:28,083 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 23:29:28,084 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:29:28,084 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 23:29:28,084 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_040d83ce-e0f3-497c-ad73-3a800d791337/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 -> a76e61da8563dd867a04fa03c43a1d8e84863fd7 [2019-11-15 23:29:28,114 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:29:28,125 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:29:28,128 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:29:28,132 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:29:28,132 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:29:28,133 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-1.c [2019-11-15 23:29:28,194 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/data/451375900/88ac6d9ca78e47c08dccbde4e7950e03/FLAG92a42a286 [2019-11-15 23:29:28,753 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:29:28,754 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-1.c [2019-11-15 23:29:28,787 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/data/451375900/88ac6d9ca78e47c08dccbde4e7950e03/FLAG92a42a286 [2019-11-15 23:29:29,013 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/data/451375900/88ac6d9ca78e47c08dccbde4e7950e03 [2019-11-15 23:29:29,015 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:29:29,016 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:29:29,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:29:29,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:29:29,020 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:29:29,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:29:29" (1/1) ... [2019-11-15 23:29:29,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41763a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:29:29, skipping insertion in model container [2019-11-15 23:29:29,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:29:29" (1/1) ... [2019-11-15 23:29:29,030 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:29:29,077 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:29:29,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:29:29,679 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:29:29,798 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:29:29,828 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:29:29,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:29:29 WrapperNode [2019-11-15 23:29:29,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:29:29,829 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:29:29,830 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:29:29,830 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:29:29,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:29:29" (1/1) ... [2019-11-15 23:29:29,880 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:29:29" (1/1) ... [2019-11-15 23:29:29,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:29:29,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:29:29,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:29:29,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:29:29,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:29:29" (1/1) ... [2019-11-15 23:29:29,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:29:29" (1/1) ... [2019-11-15 23:29:29,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:29:29" (1/1) ... [2019-11-15 23:29:29,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:29:29" (1/1) ... [2019-11-15 23:29:30,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:29:29" (1/1) ... [2019-11-15 23:29:30,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:29:29" (1/1) ... [2019-11-15 23:29:30,051 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:29:29" (1/1) ... [2019-11-15 23:29:30,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:29:30,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:29:30,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:29:30,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:29:30,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:29:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:29:30,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:29:30,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:29:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 23:29:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:29:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:29:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:29:30,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:29:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 23:29:30,374 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:29:32,890 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 23:29:32,891 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 23:29:32,892 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:29:32,892 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:29:32,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:29:32 BoogieIcfgContainer [2019-11-15 23:29:32,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:29:32,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:29:32,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:29:32,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:29:32,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:29:29" (1/3) ... [2019-11-15 23:29:32,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410fa1f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:29:32, skipping insertion in model container [2019-11-15 23:29:32,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:29:29" (2/3) ... [2019-11-15 23:29:32,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410fa1f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:29:32, skipping insertion in model container [2019-11-15 23:29:32,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:29:32" (3/3) ... [2019-11-15 23:29:32,901 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.10.i.cil-1.c [2019-11-15 23:29:32,911 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:29:32,918 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:29:32,926 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:29:32,948 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:29:32,948 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:29:32,948 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:29:32,948 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:29:32,949 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:29:32,949 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:29:32,949 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:29:32,949 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:29:32,965 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-11-15 23:29:32,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 23:29:32,974 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:29:32,974 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:29:32,976 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:29:32,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:29:32,980 INFO L82 PathProgramCache]: Analyzing trace with hash 556191018, now seen corresponding path program 1 times [2019-11-15 23:29:32,988 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:29:32,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [255154126] [2019-11-15 23:29:32,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:29:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:29:33,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:29:33,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:29:33,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:29:33,225 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:29:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:29:33,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [255154126] [2019-11-15 23:29:33,257 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:29:33,257 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 23:29:33,257 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793152600] [2019-11-15 23:29:33,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:29:33,264 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:29:33,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:29:33,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:29:33,279 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 4 states. [2019-11-15 23:29:33,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:29:33,478 INFO L93 Difference]: Finished difference Result 552 states and 941 transitions. [2019-11-15 23:29:33,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:29:33,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-15 23:29:33,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:29:33,495 INFO L225 Difference]: With dead ends: 552 [2019-11-15 23:29:33,495 INFO L226 Difference]: Without dead ends: 375 [2019-11-15 23:29:33,499 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:29:33,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-11-15 23:29:33,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2019-11-15 23:29:33,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-11-15 23:29:33,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 571 transitions. [2019-11-15 23:29:33,609 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 571 transitions. Word has length 42 [2019-11-15 23:29:33,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:29:33,610 INFO L462 AbstractCegarLoop]: Abstraction has 375 states and 571 transitions. [2019-11-15 23:29:33,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:29:33,610 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 571 transitions. [2019-11-15 23:29:33,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 23:29:33,623 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:29:33,623 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:29:33,826 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:29:33,826 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:29:33,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:29:33,826 INFO L82 PathProgramCache]: Analyzing trace with hash -755732600, now seen corresponding path program 1 times [2019-11-15 23:29:33,828 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:29:33,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [904637895] [2019-11-15 23:29:33,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:29:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:29:34,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:29:34,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:29:34,109 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:29:34,110 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:29:34,148 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:29:34,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [904637895] [2019-11-15 23:29:34,149 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:29:34,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 23:29:34,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673922194] [2019-11-15 23:29:34,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:29:34,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:29:34,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:29:34,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:29:34,152 INFO L87 Difference]: Start difference. First operand 375 states and 571 transitions. Second operand 4 states. [2019-11-15 23:29:34,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:29:34,498 INFO L93 Difference]: Finished difference Result 860 states and 1321 transitions. [2019-11-15 23:29:34,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:29:34,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-15 23:29:34,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:29:34,503 INFO L225 Difference]: With dead ends: 860 [2019-11-15 23:29:34,503 INFO L226 Difference]: Without dead ends: 615 [2019-11-15 23:29:34,505 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:29:34,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-11-15 23:29:34,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2019-11-15 23:29:34,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-11-15 23:29:34,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 934 transitions. [2019-11-15 23:29:34,569 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 934 transitions. Word has length 103 [2019-11-15 23:29:34,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:29:34,570 INFO L462 AbstractCegarLoop]: Abstraction has 615 states and 934 transitions. [2019-11-15 23:29:34,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:29:34,572 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 934 transitions. [2019-11-15 23:29:34,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-15 23:29:34,573 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:29:34,574 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:29:34,774 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:29:34,775 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:29:34,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:29:34,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1345852583, now seen corresponding path program 1 times [2019-11-15 23:29:34,776 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:29:34,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1838603740] [2019-11-15 23:29:34,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:29:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:29:35,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:29:35,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:29:35,199 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-15 23:29:35,200 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:29:35,243 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-15 23:29:35,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1838603740] [2019-11-15 23:29:35,252 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:29:35,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 23:29:35,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692855945] [2019-11-15 23:29:35,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:29:35,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:29:35,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:29:35,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:29:35,255 INFO L87 Difference]: Start difference. First operand 615 states and 934 transitions. Second operand 3 states. [2019-11-15 23:29:36,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:29:36,430 INFO L93 Difference]: Finished difference Result 1220 states and 1860 transitions. [2019-11-15 23:29:36,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:29:36,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-11-15 23:29:36,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:29:36,437 INFO L225 Difference]: With dead ends: 1220 [2019-11-15 23:29:36,437 INFO L226 Difference]: Without dead ends: 735 [2019-11-15 23:29:36,440 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:29:36,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-11-15 23:29:36,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2019-11-15 23:29:36,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2019-11-15 23:29:36,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1114 transitions. [2019-11-15 23:29:36,471 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1114 transitions. Word has length 167 [2019-11-15 23:29:36,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:29:36,472 INFO L462 AbstractCegarLoop]: Abstraction has 735 states and 1114 transitions. [2019-11-15 23:29:36,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:29:36,472 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1114 transitions. [2019-11-15 23:29:36,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-15 23:29:36,475 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:29:36,475 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 23:29:36,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:29:36,678 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:29:36,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:29:36,679 INFO L82 PathProgramCache]: Analyzing trace with hash -892992621, now seen corresponding path program 1 times [2019-11-15 23:29:36,679 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:29:36,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1968475050] [2019-11-15 23:29:36,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:29:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:29:36,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:29:36,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:29:37,033 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-15 23:29:37,036 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:29:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-15 23:29:37,091 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1968475050] [2019-11-15 23:29:37,092 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:29:37,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 23:29:37,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447061233] [2019-11-15 23:29:37,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:29:37,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:29:37,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:29:37,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:29:37,094 INFO L87 Difference]: Start difference. First operand 735 states and 1114 transitions. Second operand 4 states. [2019-11-15 23:29:37,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:29:37,796 INFO L93 Difference]: Finished difference Result 1580 states and 2406 transitions. [2019-11-15 23:29:37,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:29:37,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-11-15 23:29:37,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:29:37,803 INFO L225 Difference]: With dead ends: 1580 [2019-11-15 23:29:37,803 INFO L226 Difference]: Without dead ends: 975 [2019-11-15 23:29:37,805 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:29:37,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2019-11-15 23:29:37,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 975. [2019-11-15 23:29:37,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2019-11-15 23:29:37,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1476 transitions. [2019-11-15 23:29:37,845 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1476 transitions. Word has length 208 [2019-11-15 23:29:37,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:29:37,846 INFO L462 AbstractCegarLoop]: Abstraction has 975 states and 1476 transitions. [2019-11-15 23:29:37,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:29:37,846 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1476 transitions. [2019-11-15 23:29:37,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-11-15 23:29:37,851 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:29:37,852 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:29:38,054 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:29:38,058 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:29:38,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:29:38,059 INFO L82 PathProgramCache]: Analyzing trace with hash 72434664, now seen corresponding path program 1 times [2019-11-15 23:29:38,059 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:29:38,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1447222731] [2019-11-15 23:29:38,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_040d83ce-e0f3-497c-ad73-3a800d791337/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:29:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:29:41,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-15 23:29:41,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:29:42,506 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-15 23:29:42,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:44,074 WARN L191 SmtUtils]: Spent 1.57 s on a formula simplification that was a NOOP. DAG size: 68 [2019-11-15 23:29:44,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:44,080 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_181|, |v_#memory_$Pointer$.offset_180|], 2=[|v_#memory_$Pointer$.base_178|, |v_#memory_$Pointer$.offset_177|, |v_#memory_$Pointer$.base_177|, |v_#memory_$Pointer$.offset_178|]} [2019-11-15 23:29:44,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:44,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:44,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:44,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:44,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:44,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:44,842 INFO L235 Elim1Store]: Index analysis took 619 ms [2019-11-15 23:29:45,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 23:29:45,193 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:46,322 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 65 [2019-11-15 23:29:46,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:46,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:46,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:46,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:46,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:46,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:46,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:46,624 INFO L235 Elim1Store]: Index analysis took 236 ms [2019-11-15 23:29:46,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 23:29:46,991 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:47,527 WARN L191 SmtUtils]: Spent 534.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-15 23:29:47,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:47,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:47,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:47,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:47,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:47,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:47,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:47,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 23:29:47,712 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:48,021 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-15 23:29:48,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:48,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,104 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 23:29:48,105 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:48,277 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-15 23:29:48,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:48,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,322 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 23:29:48,323 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:48,443 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-15 23:29:48,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:48,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,526 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 23:29:48,527 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:48,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:48,564 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:29:48,564 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:156, output treesize:23 [2019-11-15 23:29:48,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 23:29:48,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:48,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:48,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,624 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 23:29:48,625 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:48,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:48,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:29:48,633 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-15 23:29:48,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,651 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 23:29:48,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:48,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:48,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,689 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 23:29:48,689 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:48,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:48,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:29:48,702 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-15 23:29:48,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,752 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 23:29:48,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:48,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:48,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 23:29:48,878 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:48,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:48,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,923 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 23:29:48,923 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:48,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:48,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 23:29:48,957 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:48,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:48,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:29:48,970 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-15 23:29:48,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:48,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 23:29:48,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:49,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:49,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:49,031 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 23:29:49,032 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:49,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:49,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:29:49,053 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-15 23:29:49,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:49,072 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 23:29:49,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:49,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:49,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:49,116 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 23:29:49,116 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:49,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:49,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:29:49,137 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-15 23:29:49,147 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_186|], 12=[|v_#memory_$Pointer$.base_187|]} [2019-11-15 23:29:49,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:49,153 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 41 [2019-11-15 23:29:49,154 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:29:49,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:49,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:49,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:49,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:49,331 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2019-11-15 23:29:49,332 INFO L341 Elim1Store]: treesize reduction 30, result has 58.3 percent of original size [2019-11-15 23:29:49,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 77 [2019-11-15 23:29:49,333 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:29:49,377 INFO L567 ElimStorePlain]: treesize reduction 80, result has 32.8 percent of original size [2019-11-15 23:29:49,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:29:49,378 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:39 [2019-11-15 23:29:49,414 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_180|], 20=[|v_#memory_$Pointer$.base_188|]} [2019-11-15 23:29:49,418 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:29:49,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:29:49,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:49,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:49,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:49,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:49,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:49,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:49,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:49,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:49,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:29:49,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:05,942 WARN L191 SmtUtils]: Spent 16.46 s on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-11-15 23:30:05,942 INFO L341 Elim1Store]: treesize reduction 11, result has 92.1 percent of original size [2019-11-15 23:30:05,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 60 treesize of output 176 [2019-11-15 23:30:05,945 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:06,055 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 29 [2019-11-15 23:30:06,055 INFO L567 ElimStorePlain]: treesize reduction 185, result has 20.6 percent of original size [2019-11-15 23:30:06,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:30:06,056 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:77, output treesize:39 [2019-11-15 23:30:06,119 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_197|], 20=[|v_#memory_$Pointer$.base_189|]} [2019-11-15 23:30:06,131 INFO L375 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-11-15 23:30:06,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:06,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:06,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:06,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:06,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:06,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:06,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:06,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:14,422 WARN L191 SmtUtils]: Spent 8.22 s on a formula simplification that was a NOOP. DAG size: 49 [2019-11-15 23:30:14,422 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:14,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 134 [2019-11-15 23:30:14,424 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:14,477 INFO L567 ElimStorePlain]: treesize reduction 134, result has 26.4 percent of original size [2019-11-15 23:30:14,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:30:14,478 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:48 [2019-11-15 23:30:14,511 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_187|], 2=[|v_#memory_int_198|], 12=[|v_#memory_$Pointer$.base_190|]} [2019-11-15 23:30:14,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-11-15 23:30:14,518 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:30:14,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:14,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2019-11-15 23:30:14,550 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:14,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:14,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:14,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:14,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:14,617 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:14,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 69 [2019-11-15 23:30:14,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:30:14,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:30:14,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:30:14,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:30:14,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:30:14,626 INFO L496 ElimStorePlain]: Start of recursive call 4: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-15 23:30:14,719 INFO L567 ElimStorePlain]: treesize reduction 52, result has 51.9 percent of original size [2019-11-15 23:30:14,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-15 23:30:14,720 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:79, output treesize:56 [2019-11-15 23:30:14,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:14,797 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-11-15 23:30:14,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:14,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:14,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:30:14,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2019-11-15 23:30:14,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-11-15 23:30:14,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:14,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:14,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:30:14,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-11-15 23:30:15,250 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 410 proven. 160 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-15 23:30:15,250 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:30:15,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-11-15 23:30:15,326 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:30:15,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:15,334 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:30:15,334 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2019-11-15 23:30:15,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:15,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:15,634 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:30:15,634 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 23:30:15,637 INFO L168 Benchmark]: Toolchain (without parser) took 46621.72 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 288.9 MB). Free memory was 948.3 MB in the beginning and 1.3 GB in the end (delta: -320.5 MB). Peak memory consumption was 449.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:30:15,638 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:30:15,638 INFO L168 Benchmark]: CACSL2BoogieTranslator took 812.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -130.8 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:30:15,638 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:30:15,638 INFO L168 Benchmark]: Boogie Preprocessor took 127.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:30:15,639 INFO L168 Benchmark]: RCFGBuilder took 2829.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 970.5 MB in the end (delta: 94.8 MB). Peak memory consumption was 94.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:30:15,639 INFO L168 Benchmark]: TraceAbstraction took 42741.55 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 180.9 MB). Free memory was 970.5 MB in the beginning and 1.3 GB in the end (delta: -298.3 MB). Peak memory consumption was 363.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:30:15,644 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 812.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -130.8 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 107.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 127.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2829.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 970.5 MB in the end (delta: 94.8 MB). Peak memory consumption was 94.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42741.55 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 180.9 MB). Free memory was 970.5 MB in the beginning and 1.3 GB in the end (delta: -298.3 MB). Peak memory consumption was 363.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...