./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/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 a9e85c0038d1608b1041d2a9bd9534081fc54745 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/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 a9e85c0038d1608b1041d2a9bd9534081fc54745 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: NullPointerException: null --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:18:30,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:18:30,605 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:18:30,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:18:30,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:18:30,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:18:30,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:18:30,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:18:30,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:18:30,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:18:30,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:18:30,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:18:30,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:18:30,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:18:30,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:18:30,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:18:30,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:18:30,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:18:30,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:18:30,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:18:30,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:18:30,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:18:30,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:18:30,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:18:30,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:18:30,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:18:30,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:18:30,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:18:30,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:18:30,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:18:30,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:18:30,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:18:30,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:18:30,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:18:30,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:18:30,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:18:30,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:18:30,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:18:30,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:18:30,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:18:30,648 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:18:30,649 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:18:30,661 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:18:30,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:18:30,662 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:18:30,662 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:18:30,663 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:18:30,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:18:30,663 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:18:30,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:18:30,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:18:30,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:18:30,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:18:30,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:18:30,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:18:30,665 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:18:30,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:18:30,665 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:18:30,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:18:30,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:18:30,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:18:30,666 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:18:30,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:18:30,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:18:30,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:18:30,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:18:30,667 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:18:30,667 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:18:30,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:18:30,668 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:18:30,668 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_03acfa36-789b-4934-8dd4-9773202ec553/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 -> a9e85c0038d1608b1041d2a9bd9534081fc54745 [2019-11-16 00:18:30,693 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:18:30,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:18:30,706 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:18:30,708 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:18:30,708 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:18:30,708 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-2.c [2019-11-16 00:18:30,761 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/data/1af058901/a65210eea8f34d3aa01dd8cbb08c7032/FLAG362cc51a3 [2019-11-16 00:18:31,327 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:18:31,328 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-2.c [2019-11-16 00:18:31,362 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/data/1af058901/a65210eea8f34d3aa01dd8cbb08c7032/FLAG362cc51a3 [2019-11-16 00:18:31,781 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/data/1af058901/a65210eea8f34d3aa01dd8cbb08c7032 [2019-11-16 00:18:31,784 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:18:31,786 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:18:31,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:18:31,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:18:31,794 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:18:31,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:18:31" (1/1) ... [2019-11-16 00:18:31,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e0c4673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:31, skipping insertion in model container [2019-11-16 00:18:31,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:18:31" (1/1) ... [2019-11-16 00:18:31,813 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:18:31,890 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:18:32,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:18:32,486 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:18:32,656 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:18:32,681 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:18:32,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:32 WrapperNode [2019-11-16 00:18:32,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:18:32,683 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:18:32,683 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:18:32,683 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:18:32,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:32" (1/1) ... [2019-11-16 00:18:32,741 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:32" (1/1) ... [2019-11-16 00:18:32,799 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:18:32,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:18:32,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:18:32,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:18:32,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:32" (1/1) ... [2019-11-16 00:18:32,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:32" (1/1) ... [2019-11-16 00:18:32,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:32" (1/1) ... [2019-11-16 00:18:32,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:32" (1/1) ... [2019-11-16 00:18:32,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:32" (1/1) ... [2019-11-16 00:18:32,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:32" (1/1) ... [2019-11-16 00:18:32,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:32" (1/1) ... [2019-11-16 00:18:32,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:18:32,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:18:32,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:18:32,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:18:32,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:18:32,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:18:32,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:18:32,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:18:32,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:18:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:18:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:18:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:18:32,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:18:33,179 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:18:34,016 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-16 00:18:34,016 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-16 00:18:34,017 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:18:34,018 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:18:34,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:18:34 BoogieIcfgContainer [2019-11-16 00:18:34,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:18:34,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:18:34,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:18:34,023 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:18:34,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:18:31" (1/3) ... [2019-11-16 00:18:34,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7482b8a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:18:34, skipping insertion in model container [2019-11-16 00:18:34,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:32" (2/3) ... [2019-11-16 00:18:34,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7482b8a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:18:34, skipping insertion in model container [2019-11-16 00:18:34,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:18:34" (3/3) ... [2019-11-16 00:18:34,027 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-2.c [2019-11-16 00:18:34,036 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:18:34,043 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:18:34,054 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:18:34,076 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:18:34,077 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:18:34,077 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:18:34,077 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:18:34,077 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:18:34,077 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:18:34,077 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:18:34,077 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:18:34,103 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-11-16 00:18:34,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-16 00:18:34,115 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:34,116 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:34,119 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:34,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:34,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-11-16 00:18:34,129 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:34,130 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869371427] [2019-11-16 00:18:34,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:34,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:34,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:34,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:18:34,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869371427] [2019-11-16 00:18:34,433 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:34,434 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:34,434 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795472992] [2019-11-16 00:18:34,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:34,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:34,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:34,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:34,456 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2019-11-16 00:18:34,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:34,891 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2019-11-16 00:18:34,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:34,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-16 00:18:34,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:34,906 INFO L225 Difference]: With dead ends: 255 [2019-11-16 00:18:34,906 INFO L226 Difference]: Without dead ends: 116 [2019-11-16 00:18:34,915 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:34,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-16 00:18:34,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-11-16 00:18:34,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-16 00:18:34,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2019-11-16 00:18:34,993 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2019-11-16 00:18:34,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:34,994 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2019-11-16 00:18:34,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:34,994 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2019-11-16 00:18:34,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-16 00:18:34,998 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:34,998 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:34,999 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:34,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:34,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1001988123, now seen corresponding path program 1 times [2019-11-16 00:18:34,999 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:35,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370356325] [2019-11-16 00:18:35,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:35,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:35,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:35,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:18:35,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370356325] [2019-11-16 00:18:35,162 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:35,163 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:18:35,163 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622846211] [2019-11-16 00:18:35,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:18:35,164 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:35,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:18:35,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:18:35,165 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand 3 states. [2019-11-16 00:18:35,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:35,228 INFO L93 Difference]: Finished difference Result 321 states and 484 transitions. [2019-11-16 00:18:35,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:18:35,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-16 00:18:35,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:35,232 INFO L225 Difference]: With dead ends: 321 [2019-11-16 00:18:35,232 INFO L226 Difference]: Without dead ends: 216 [2019-11-16 00:18:35,233 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:18:35,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-16 00:18:35,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-16 00:18:35,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-16 00:18:35,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 320 transitions. [2019-11-16 00:18:35,257 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 320 transitions. Word has length 38 [2019-11-16 00:18:35,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:35,258 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 320 transitions. [2019-11-16 00:18:35,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:18:35,258 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 320 transitions. [2019-11-16 00:18:35,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:18:35,268 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:35,268 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:35,269 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:35,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:35,270 INFO L82 PathProgramCache]: Analyzing trace with hash -596933037, now seen corresponding path program 1 times [2019-11-16 00:18:35,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:35,271 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559824638] [2019-11-16 00:18:35,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:35,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:35,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:35,441 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:18:35,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559824638] [2019-11-16 00:18:35,444 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:35,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:18:35,445 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738740785] [2019-11-16 00:18:35,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:18:35,447 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:35,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:18:35,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:18:35,448 INFO L87 Difference]: Start difference. First operand 216 states and 320 transitions. Second operand 3 states. [2019-11-16 00:18:35,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:35,556 INFO L93 Difference]: Finished difference Result 420 states and 629 transitions. [2019-11-16 00:18:35,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:18:35,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-16 00:18:35,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:35,562 INFO L225 Difference]: With dead ends: 420 [2019-11-16 00:18:35,563 INFO L226 Difference]: Without dead ends: 315 [2019-11-16 00:18:35,564 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:18:35,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-16 00:18:35,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-11-16 00:18:35,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-16 00:18:35,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 466 transitions. [2019-11-16 00:18:35,588 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 466 transitions. Word has length 53 [2019-11-16 00:18:35,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:35,589 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 466 transitions. [2019-11-16 00:18:35,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:18:35,589 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 466 transitions. [2019-11-16 00:18:35,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-16 00:18:35,591 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:35,592 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:35,592 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:35,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:35,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1173568974, now seen corresponding path program 1 times [2019-11-16 00:18:35,593 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:35,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465271597] [2019-11-16 00:18:35,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:35,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:35,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:35,749 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:18:35,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465271597] [2019-11-16 00:18:35,750 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:35,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:35,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885080334] [2019-11-16 00:18:35,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:35,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:35,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:35,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:35,753 INFO L87 Difference]: Start difference. First operand 315 states and 466 transitions. Second operand 4 states. [2019-11-16 00:18:36,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:36,437 INFO L93 Difference]: Finished difference Result 806 states and 1197 transitions. [2019-11-16 00:18:36,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:36,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-16 00:18:36,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:36,441 INFO L225 Difference]: With dead ends: 806 [2019-11-16 00:18:36,442 INFO L226 Difference]: Without dead ends: 501 [2019-11-16 00:18:36,445 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:36,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-11-16 00:18:36,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 365. [2019-11-16 00:18:36,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-11-16 00:18:36,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 552 transitions. [2019-11-16 00:18:36,479 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 552 transitions. Word has length 71 [2019-11-16 00:18:36,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:36,489 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 552 transitions. [2019-11-16 00:18:36,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 552 transitions. [2019-11-16 00:18:36,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-16 00:18:36,492 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:36,492 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:36,492 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:36,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:36,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1307582480, now seen corresponding path program 1 times [2019-11-16 00:18:36,493 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:36,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122586312] [2019-11-16 00:18:36,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:36,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:36,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:36,622 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:18:36,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122586312] [2019-11-16 00:18:36,623 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:36,623 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:36,623 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092115028] [2019-11-16 00:18:36,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:36,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:36,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:36,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:36,625 INFO L87 Difference]: Start difference. First operand 365 states and 552 transitions. Second operand 4 states. [2019-11-16 00:18:37,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:37,113 INFO L93 Difference]: Finished difference Result 806 states and 1218 transitions. [2019-11-16 00:18:37,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:37,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-16 00:18:37,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:37,120 INFO L225 Difference]: With dead ends: 806 [2019-11-16 00:18:37,121 INFO L226 Difference]: Without dead ends: 451 [2019-11-16 00:18:37,122 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:37,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-16 00:18:37,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 405. [2019-11-16 00:18:37,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-11-16 00:18:37,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 620 transitions. [2019-11-16 00:18:37,142 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 620 transitions. Word has length 71 [2019-11-16 00:18:37,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:37,143 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 620 transitions. [2019-11-16 00:18:37,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:37,143 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 620 transitions. [2019-11-16 00:18:37,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-16 00:18:37,144 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:37,145 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:37,145 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:37,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:37,145 INFO L82 PathProgramCache]: Analyzing trace with hash -2025585655, now seen corresponding path program 1 times [2019-11-16 00:18:37,146 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:37,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938159851] [2019-11-16 00:18:37,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:37,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:37,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:37,257 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:18:37,257 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938159851] [2019-11-16 00:18:37,258 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:37,258 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:37,258 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066580561] [2019-11-16 00:18:37,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:37,259 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:37,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:37,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:37,259 INFO L87 Difference]: Start difference. First operand 405 states and 620 transitions. Second operand 4 states. [2019-11-16 00:18:37,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:37,816 INFO L93 Difference]: Finished difference Result 928 states and 1409 transitions. [2019-11-16 00:18:37,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:37,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-16 00:18:37,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:37,821 INFO L225 Difference]: With dead ends: 928 [2019-11-16 00:18:37,822 INFO L226 Difference]: Without dead ends: 533 [2019-11-16 00:18:37,823 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:37,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-11-16 00:18:37,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 407. [2019-11-16 00:18:37,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:18:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 622 transitions. [2019-11-16 00:18:37,839 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 622 transitions. Word has length 72 [2019-11-16 00:18:37,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:37,848 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 622 transitions. [2019-11-16 00:18:37,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:37,848 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 622 transitions. [2019-11-16 00:18:37,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:18:37,851 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:37,851 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:37,851 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:37,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:37,852 INFO L82 PathProgramCache]: Analyzing trace with hash 703880522, now seen corresponding path program 2 times [2019-11-16 00:18:37,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:37,853 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639290519] [2019-11-16 00:18:37,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:37,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:37,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:37,962 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:18:37,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639290519] [2019-11-16 00:18:37,963 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:37,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:37,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821568628] [2019-11-16 00:18:37,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:37,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:37,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:37,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:37,964 INFO L87 Difference]: Start difference. First operand 407 states and 622 transitions. Second operand 4 states. [2019-11-16 00:18:38,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:38,503 INFO L93 Difference]: Finished difference Result 928 states and 1407 transitions. [2019-11-16 00:18:38,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:38,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-16 00:18:38,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:38,507 INFO L225 Difference]: With dead ends: 928 [2019-11-16 00:18:38,507 INFO L226 Difference]: Without dead ends: 531 [2019-11-16 00:18:38,508 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:38,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-16 00:18:38,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2019-11-16 00:18:38,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:18:38,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 620 transitions. [2019-11-16 00:18:38,521 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 620 transitions. Word has length 85 [2019-11-16 00:18:38,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:38,522 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 620 transitions. [2019-11-16 00:18:38,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:38,522 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 620 transitions. [2019-11-16 00:18:38,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:18:38,523 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:38,523 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:38,524 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:38,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:38,524 INFO L82 PathProgramCache]: Analyzing trace with hash -405099924, now seen corresponding path program 1 times [2019-11-16 00:18:38,524 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:38,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799129979] [2019-11-16 00:18:38,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:38,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:38,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:18:38,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799129979] [2019-11-16 00:18:38,593 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:38,593 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:38,594 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349183351] [2019-11-16 00:18:38,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:38,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:38,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:38,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:38,595 INFO L87 Difference]: Start difference. First operand 407 states and 620 transitions. Second operand 4 states. [2019-11-16 00:18:39,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:39,163 INFO L93 Difference]: Finished difference Result 928 states and 1403 transitions. [2019-11-16 00:18:39,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:39,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-16 00:18:39,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:39,168 INFO L225 Difference]: With dead ends: 928 [2019-11-16 00:18:39,168 INFO L226 Difference]: Without dead ends: 531 [2019-11-16 00:18:39,169 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:39,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-16 00:18:39,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2019-11-16 00:18:39,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:18:39,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 618 transitions. [2019-11-16 00:18:39,182 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 618 transitions. Word has length 85 [2019-11-16 00:18:39,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:39,183 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 618 transitions. [2019-11-16 00:18:39,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:39,183 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 618 transitions. [2019-11-16 00:18:39,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:18:39,185 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:39,185 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:39,185 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:39,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:39,186 INFO L82 PathProgramCache]: Analyzing trace with hash -325478776, now seen corresponding path program 2 times [2019-11-16 00:18:39,186 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:39,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997101544] [2019-11-16 00:18:39,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:39,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:39,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:18:39,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997101544] [2019-11-16 00:18:39,269 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:39,269 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:39,271 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934208078] [2019-11-16 00:18:39,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:39,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:39,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:39,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:39,272 INFO L87 Difference]: Start difference. First operand 407 states and 618 transitions. Second operand 4 states. [2019-11-16 00:18:39,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:39,671 INFO L93 Difference]: Finished difference Result 848 states and 1278 transitions. [2019-11-16 00:18:39,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:39,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-16 00:18:39,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:39,675 INFO L225 Difference]: With dead ends: 848 [2019-11-16 00:18:39,675 INFO L226 Difference]: Without dead ends: 451 [2019-11-16 00:18:39,676 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:39,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-16 00:18:39,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2019-11-16 00:18:39,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:18:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 616 transitions. [2019-11-16 00:18:39,694 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 616 transitions. Word has length 85 [2019-11-16 00:18:39,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:39,695 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 616 transitions. [2019-11-16 00:18:39,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:39,695 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 616 transitions. [2019-11-16 00:18:39,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:18:39,697 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:39,697 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:39,697 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:39,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:39,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1434459222, now seen corresponding path program 1 times [2019-11-16 00:18:39,699 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:39,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964793610] [2019-11-16 00:18:39,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:39,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:39,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:39,776 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:18:39,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964793610] [2019-11-16 00:18:39,777 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:39,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:39,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393650107] [2019-11-16 00:18:39,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:39,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:39,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:39,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:39,779 INFO L87 Difference]: Start difference. First operand 407 states and 616 transitions. Second operand 4 states. [2019-11-16 00:18:40,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:40,161 INFO L93 Difference]: Finished difference Result 848 states and 1274 transitions. [2019-11-16 00:18:40,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:40,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-16 00:18:40,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:40,165 INFO L225 Difference]: With dead ends: 848 [2019-11-16 00:18:40,165 INFO L226 Difference]: Without dead ends: 451 [2019-11-16 00:18:40,166 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:40,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-16 00:18:40,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2019-11-16 00:18:40,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:18:40,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 614 transitions. [2019-11-16 00:18:40,180 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 614 transitions. Word has length 85 [2019-11-16 00:18:40,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:40,181 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 614 transitions. [2019-11-16 00:18:40,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:40,181 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 614 transitions. [2019-11-16 00:18:40,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-16 00:18:40,183 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:40,183 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:40,183 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:40,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:40,184 INFO L82 PathProgramCache]: Analyzing trace with hash 381197251, now seen corresponding path program 1 times [2019-11-16 00:18:40,184 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:40,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141217588] [2019-11-16 00:18:40,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:40,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:40,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:18:40,257 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141217588] [2019-11-16 00:18:40,258 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:40,258 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:40,258 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841618748] [2019-11-16 00:18:40,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:40,259 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:40,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:40,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:40,260 INFO L87 Difference]: Start difference. First operand 407 states and 614 transitions. Second operand 4 states. [2019-11-16 00:18:40,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:40,845 INFO L93 Difference]: Finished difference Result 928 states and 1391 transitions. [2019-11-16 00:18:40,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:40,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-16 00:18:40,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:40,849 INFO L225 Difference]: With dead ends: 928 [2019-11-16 00:18:40,849 INFO L226 Difference]: Without dead ends: 531 [2019-11-16 00:18:40,850 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:40,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-16 00:18:40,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2019-11-16 00:18:40,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:18:40,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 612 transitions. [2019-11-16 00:18:40,862 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 612 transitions. Word has length 86 [2019-11-16 00:18:40,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:40,863 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 612 transitions. [2019-11-16 00:18:40,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:40,863 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 612 transitions. [2019-11-16 00:18:40,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-16 00:18:40,864 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:40,865 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:40,865 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:40,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:40,865 INFO L82 PathProgramCache]: Analyzing trace with hash 681258334, now seen corresponding path program 1 times [2019-11-16 00:18:40,865 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:40,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668698500] [2019-11-16 00:18:40,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:40,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:40,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:40,936 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:18:40,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668698500] [2019-11-16 00:18:40,937 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:40,937 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:40,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108532259] [2019-11-16 00:18:40,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:40,938 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:40,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:40,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:40,939 INFO L87 Difference]: Start difference. First operand 407 states and 612 transitions. Second operand 4 states. [2019-11-16 00:18:41,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:41,440 INFO L93 Difference]: Finished difference Result 783 states and 1168 transitions. [2019-11-16 00:18:41,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:41,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-16 00:18:41,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:41,443 INFO L225 Difference]: With dead ends: 783 [2019-11-16 00:18:41,444 INFO L226 Difference]: Without dead ends: 531 [2019-11-16 00:18:41,445 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-16 00:18:41,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2019-11-16 00:18:41,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:18:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 610 transitions. [2019-11-16 00:18:41,457 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 610 transitions. Word has length 86 [2019-11-16 00:18:41,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:41,457 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 610 transitions. [2019-11-16 00:18:41,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:41,458 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 610 transitions. [2019-11-16 00:18:41,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-16 00:18:41,459 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:41,459 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:41,459 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:41,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:41,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1464169915, now seen corresponding path program 1 times [2019-11-16 00:18:41,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:41,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089434640] [2019-11-16 00:18:41,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:41,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:41,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:41,521 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:18:41,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089434640] [2019-11-16 00:18:41,522 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:41,522 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:41,522 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311764593] [2019-11-16 00:18:41,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:41,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:41,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:41,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:41,523 INFO L87 Difference]: Start difference. First operand 407 states and 610 transitions. Second operand 4 states. [2019-11-16 00:18:41,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:41,879 INFO L93 Difference]: Finished difference Result 848 states and 1262 transitions. [2019-11-16 00:18:41,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:41,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-16 00:18:41,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:41,883 INFO L225 Difference]: With dead ends: 848 [2019-11-16 00:18:41,883 INFO L226 Difference]: Without dead ends: 451 [2019-11-16 00:18:41,884 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:41,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-16 00:18:41,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2019-11-16 00:18:41,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:18:41,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 608 transitions. [2019-11-16 00:18:41,896 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 608 transitions. Word has length 86 [2019-11-16 00:18:41,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:41,896 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 608 transitions. [2019-11-16 00:18:41,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:41,897 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 608 transitions. [2019-11-16 00:18:41,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-16 00:18:41,898 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:41,898 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:41,898 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:41,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:41,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1164108832, now seen corresponding path program 1 times [2019-11-16 00:18:41,899 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:41,899 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894911430] [2019-11-16 00:18:41,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:41,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:41,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:18:41,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894911430] [2019-11-16 00:18:41,965 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:41,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:41,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582532209] [2019-11-16 00:18:41,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:41,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:41,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:41,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:41,967 INFO L87 Difference]: Start difference. First operand 407 states and 608 transitions. Second operand 4 states. [2019-11-16 00:18:42,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:42,378 INFO L93 Difference]: Finished difference Result 703 states and 1041 transitions. [2019-11-16 00:18:42,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:42,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-16 00:18:42,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:42,381 INFO L225 Difference]: With dead ends: 703 [2019-11-16 00:18:42,382 INFO L226 Difference]: Without dead ends: 451 [2019-11-16 00:18:42,383 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:42,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-16 00:18:42,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2019-11-16 00:18:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:18:42,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 606 transitions. [2019-11-16 00:18:42,402 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 606 transitions. Word has length 86 [2019-11-16 00:18:42,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:42,403 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 606 transitions. [2019-11-16 00:18:42,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:42,403 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 606 transitions. [2019-11-16 00:18:42,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:18:42,404 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:42,405 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:42,405 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:42,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:42,405 INFO L82 PathProgramCache]: Analyzing trace with hash -956813465, now seen corresponding path program 1 times [2019-11-16 00:18:42,405 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:42,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014868116] [2019-11-16 00:18:42,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:42,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:42,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:42,466 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:18:42,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014868116] [2019-11-16 00:18:42,467 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:42,467 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:42,467 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376375052] [2019-11-16 00:18:42,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:42,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:42,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:42,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:42,468 INFO L87 Difference]: Start difference. First operand 407 states and 606 transitions. Second operand 4 states. [2019-11-16 00:18:43,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:43,039 INFO L93 Difference]: Finished difference Result 928 states and 1375 transitions. [2019-11-16 00:18:43,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:43,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-16 00:18:43,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:43,043 INFO L225 Difference]: With dead ends: 928 [2019-11-16 00:18:43,044 INFO L226 Difference]: Without dead ends: 531 [2019-11-16 00:18:43,045 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:43,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-16 00:18:43,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2019-11-16 00:18:43,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:18:43,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 604 transitions. [2019-11-16 00:18:43,057 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 604 transitions. Word has length 87 [2019-11-16 00:18:43,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:43,058 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 604 transitions. [2019-11-16 00:18:43,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:43,058 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 604 transitions. [2019-11-16 00:18:43,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:18:43,059 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:43,060 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:43,060 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:43,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:43,060 INFO L82 PathProgramCache]: Analyzing trace with hash 2048176167, now seen corresponding path program 1 times [2019-11-16 00:18:43,060 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:43,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810762825] [2019-11-16 00:18:43,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:43,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:43,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:43,128 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:18:43,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810762825] [2019-11-16 00:18:43,130 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:43,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:43,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154350595] [2019-11-16 00:18:43,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:43,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:43,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:43,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:43,132 INFO L87 Difference]: Start difference. First operand 407 states and 604 transitions. Second operand 4 states. [2019-11-16 00:18:43,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:43,670 INFO L93 Difference]: Finished difference Result 777 states and 1149 transitions. [2019-11-16 00:18:43,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:43,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-16 00:18:43,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:43,674 INFO L225 Difference]: With dead ends: 777 [2019-11-16 00:18:43,674 INFO L226 Difference]: Without dead ends: 525 [2019-11-16 00:18:43,675 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:43,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-11-16 00:18:43,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 407. [2019-11-16 00:18:43,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:18:43,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 602 transitions. [2019-11-16 00:18:43,688 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 602 transitions. Word has length 87 [2019-11-16 00:18:43,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:43,688 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 602 transitions. [2019-11-16 00:18:43,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:43,688 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 602 transitions. [2019-11-16 00:18:43,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:18:43,690 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:43,690 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:43,690 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:43,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:43,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1966346533, now seen corresponding path program 1 times [2019-11-16 00:18:43,691 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:43,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091509352] [2019-11-16 00:18:43,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:43,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:43,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:43,763 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:18:43,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091509352] [2019-11-16 00:18:43,764 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:43,764 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:43,764 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020033609] [2019-11-16 00:18:43,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:43,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:43,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:43,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:43,765 INFO L87 Difference]: Start difference. First operand 407 states and 602 transitions. Second operand 4 states. [2019-11-16 00:18:44,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:44,188 INFO L93 Difference]: Finished difference Result 848 states and 1246 transitions. [2019-11-16 00:18:44,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:44,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-16 00:18:44,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:44,191 INFO L225 Difference]: With dead ends: 848 [2019-11-16 00:18:44,191 INFO L226 Difference]: Without dead ends: 451 [2019-11-16 00:18:44,193 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:44,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-16 00:18:44,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2019-11-16 00:18:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:18:44,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 600 transitions. [2019-11-16 00:18:44,206 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 600 transitions. Word has length 87 [2019-11-16 00:18:44,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:44,206 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 600 transitions. [2019-11-16 00:18:44,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:44,207 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 600 transitions. [2019-11-16 00:18:44,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:18:44,208 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:44,208 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:44,209 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:44,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:44,209 INFO L82 PathProgramCache]: Analyzing trace with hash 676368869, now seen corresponding path program 1 times [2019-11-16 00:18:44,209 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:44,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186499484] [2019-11-16 00:18:44,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:44,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:44,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:44,330 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:18:44,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186499484] [2019-11-16 00:18:44,330 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:44,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:44,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893411975] [2019-11-16 00:18:44,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:44,331 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:44,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:44,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:44,331 INFO L87 Difference]: Start difference. First operand 407 states and 600 transitions. Second operand 4 states. [2019-11-16 00:18:44,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:44,693 INFO L93 Difference]: Finished difference Result 697 states and 1022 transitions. [2019-11-16 00:18:44,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:44,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-16 00:18:44,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:44,696 INFO L225 Difference]: With dead ends: 697 [2019-11-16 00:18:44,696 INFO L226 Difference]: Without dead ends: 445 [2019-11-16 00:18:44,697 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:44,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-11-16 00:18:44,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 407. [2019-11-16 00:18:44,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:18:44,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 598 transitions. [2019-11-16 00:18:44,711 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 598 transitions. Word has length 87 [2019-11-16 00:18:44,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:44,711 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 598 transitions. [2019-11-16 00:18:44,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:44,712 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 598 transitions. [2019-11-16 00:18:44,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-16 00:18:44,713 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:44,713 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:44,714 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:44,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:44,714 INFO L82 PathProgramCache]: Analyzing trace with hash 571107934, now seen corresponding path program 1 times [2019-11-16 00:18:44,714 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:44,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900250427] [2019-11-16 00:18:44,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:44,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:44,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:44,781 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:18:44,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900250427] [2019-11-16 00:18:44,781 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:44,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:44,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177931831] [2019-11-16 00:18:44,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:44,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:44,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:44,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:44,784 INFO L87 Difference]: Start difference. First operand 407 states and 598 transitions. Second operand 4 states. [2019-11-16 00:18:45,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:45,312 INFO L93 Difference]: Finished difference Result 904 states and 1330 transitions. [2019-11-16 00:18:45,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:45,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-16 00:18:45,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:45,315 INFO L225 Difference]: With dead ends: 904 [2019-11-16 00:18:45,316 INFO L226 Difference]: Without dead ends: 507 [2019-11-16 00:18:45,316 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:45,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-11-16 00:18:45,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 407. [2019-11-16 00:18:45,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:18:45,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 596 transitions. [2019-11-16 00:18:45,337 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 596 transitions. Word has length 88 [2019-11-16 00:18:45,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:45,338 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 596 transitions. [2019-11-16 00:18:45,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:45,338 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 596 transitions. [2019-11-16 00:18:45,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-16 00:18:45,341 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:45,342 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:45,342 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:45,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:45,342 INFO L82 PathProgramCache]: Analyzing trace with hash 994754656, now seen corresponding path program 1 times [2019-11-16 00:18:45,342 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:45,342 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278504239] [2019-11-16 00:18:45,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:45,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:45,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:45,413 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:18:45,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278504239] [2019-11-16 00:18:45,414 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:45,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:45,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276087953] [2019-11-16 00:18:45,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:45,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:45,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:45,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:45,415 INFO L87 Difference]: Start difference. First operand 407 states and 596 transitions. Second operand 4 states. [2019-11-16 00:18:45,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:45,725 INFO L93 Difference]: Finished difference Result 824 states and 1205 transitions. [2019-11-16 00:18:45,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:45,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-16 00:18:45,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:45,729 INFO L225 Difference]: With dead ends: 824 [2019-11-16 00:18:45,729 INFO L226 Difference]: Without dead ends: 427 [2019-11-16 00:18:45,730 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:45,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-11-16 00:18:45,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 407. [2019-11-16 00:18:45,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:18:45,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 594 transitions. [2019-11-16 00:18:45,742 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 594 transitions. Word has length 88 [2019-11-16 00:18:45,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:45,742 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 594 transitions. [2019-11-16 00:18:45,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:45,743 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 594 transitions. [2019-11-16 00:18:45,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-16 00:18:45,744 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:45,744 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:45,745 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:45,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:45,745 INFO L82 PathProgramCache]: Analyzing trace with hash -433365501, now seen corresponding path program 1 times [2019-11-16 00:18:45,745 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:45,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183821806] [2019-11-16 00:18:45,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:45,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:45,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:45,813 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:18:45,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183821806] [2019-11-16 00:18:45,813 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:45,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:45,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464184832] [2019-11-16 00:18:45,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:45,814 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:45,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:45,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:45,815 INFO L87 Difference]: Start difference. First operand 407 states and 594 transitions. Second operand 4 states. [2019-11-16 00:18:46,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:46,295 INFO L93 Difference]: Finished difference Result 904 states and 1322 transitions. [2019-11-16 00:18:46,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:46,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-16 00:18:46,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:46,299 INFO L225 Difference]: With dead ends: 904 [2019-11-16 00:18:46,299 INFO L226 Difference]: Without dead ends: 507 [2019-11-16 00:18:46,300 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:46,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-11-16 00:18:46,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 407. [2019-11-16 00:18:46,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:18:46,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 592 transitions. [2019-11-16 00:18:46,312 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 592 transitions. Word has length 89 [2019-11-16 00:18:46,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:46,312 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 592 transitions. [2019-11-16 00:18:46,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:46,312 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 592 transitions. [2019-11-16 00:18:46,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-16 00:18:46,314 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:46,314 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:46,314 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:46,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:46,315 INFO L82 PathProgramCache]: Analyzing trace with hash -185219007, now seen corresponding path program 1 times [2019-11-16 00:18:46,315 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:46,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889857084] [2019-11-16 00:18:46,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:46,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:46,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:46,372 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-16 00:18:46,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889857084] [2019-11-16 00:18:46,373 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:46,373 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:18:46,373 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290969034] [2019-11-16 00:18:46,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:18:46,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:46,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:18:46,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:18:46,374 INFO L87 Difference]: Start difference. First operand 407 states and 592 transitions. Second operand 3 states. [2019-11-16 00:18:46,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:46,415 INFO L93 Difference]: Finished difference Result 806 states and 1179 transitions. [2019-11-16 00:18:46,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:18:46,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-16 00:18:46,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:46,418 INFO L225 Difference]: With dead ends: 806 [2019-11-16 00:18:46,419 INFO L226 Difference]: Without dead ends: 556 [2019-11-16 00:18:46,419 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:18:46,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-11-16 00:18:46,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2019-11-16 00:18:46,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-11-16 00:18:46,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 809 transitions. [2019-11-16 00:18:46,434 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 809 transitions. Word has length 89 [2019-11-16 00:18:46,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:46,434 INFO L462 AbstractCegarLoop]: Abstraction has 556 states and 809 transitions. [2019-11-16 00:18:46,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:18:46,434 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 809 transitions. [2019-11-16 00:18:46,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-16 00:18:46,436 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:46,436 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:46,436 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:46,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:46,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1027809079, now seen corresponding path program 1 times [2019-11-16 00:18:46,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:46,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039771260] [2019-11-16 00:18:46,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:46,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:46,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:46,492 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-16 00:18:46,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039771260] [2019-11-16 00:18:46,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:46,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:18:46,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635555839] [2019-11-16 00:18:46,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:18:46,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:46,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:18:46,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:18:46,495 INFO L87 Difference]: Start difference. First operand 556 states and 809 transitions. Second operand 3 states. [2019-11-16 00:18:46,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:46,547 INFO L93 Difference]: Finished difference Result 1104 states and 1613 transitions. [2019-11-16 00:18:46,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:18:46,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-11-16 00:18:46,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:46,552 INFO L225 Difference]: With dead ends: 1104 [2019-11-16 00:18:46,552 INFO L226 Difference]: Without dead ends: 705 [2019-11-16 00:18:46,553 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:18:46,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-11-16 00:18:46,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2019-11-16 00:18:46,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-11-16 00:18:46,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1027 transitions. [2019-11-16 00:18:46,573 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1027 transitions. Word has length 91 [2019-11-16 00:18:46,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:46,574 INFO L462 AbstractCegarLoop]: Abstraction has 705 states and 1027 transitions. [2019-11-16 00:18:46,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:18:46,574 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1027 transitions. [2019-11-16 00:18:46,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-16 00:18:46,576 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:46,577 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:46,577 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:46,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:46,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1254631592, now seen corresponding path program 1 times [2019-11-16 00:18:46,578 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:46,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47572883] [2019-11-16 00:18:46,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:46,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:46,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:46,649 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-16 00:18:46,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47572883] [2019-11-16 00:18:46,650 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:46,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:18:46,652 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379234188] [2019-11-16 00:18:46,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:18:46,653 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:46,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:18:46,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:18:46,654 INFO L87 Difference]: Start difference. First operand 705 states and 1027 transitions. Second operand 3 states. [2019-11-16 00:18:46,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:46,697 INFO L93 Difference]: Finished difference Result 856 states and 1248 transitions. [2019-11-16 00:18:46,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:18:46,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-11-16 00:18:46,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:46,703 INFO L225 Difference]: With dead ends: 856 [2019-11-16 00:18:46,703 INFO L226 Difference]: Without dead ends: 854 [2019-11-16 00:18:46,705 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:18:46,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-11-16 00:18:46,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2019-11-16 00:18:46,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2019-11-16 00:18:46,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1246 transitions. [2019-11-16 00:18:46,728 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1246 transitions. Word has length 112 [2019-11-16 00:18:46,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:46,729 INFO L462 AbstractCegarLoop]: Abstraction has 854 states and 1246 transitions. [2019-11-16 00:18:46,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:18:46,729 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1246 transitions. [2019-11-16 00:18:46,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-16 00:18:46,732 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:46,732 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:46,733 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:46,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:46,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1643481221, now seen corresponding path program 1 times [2019-11-16 00:18:46,733 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:46,733 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222287282] [2019-11-16 00:18:46,734 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:46,734 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:46,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:46,829 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-16 00:18:46,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222287282] [2019-11-16 00:18:46,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:46,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:46,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292236360] [2019-11-16 00:18:46,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:46,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:46,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:46,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:46,832 INFO L87 Difference]: Start difference. First operand 854 states and 1246 transitions. Second operand 4 states. [2019-11-16 00:18:47,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:47,469 INFO L93 Difference]: Finished difference Result 2242 states and 3302 transitions. [2019-11-16 00:18:47,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:47,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-16 00:18:47,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:47,477 INFO L225 Difference]: With dead ends: 2242 [2019-11-16 00:18:47,477 INFO L226 Difference]: Without dead ends: 1398 [2019-11-16 00:18:47,479 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:47,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2019-11-16 00:18:47,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 962. [2019-11-16 00:18:47,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2019-11-16 00:18:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1426 transitions. [2019-11-16 00:18:47,543 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1426 transitions. Word has length 149 [2019-11-16 00:18:47,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:47,544 INFO L462 AbstractCegarLoop]: Abstraction has 962 states and 1426 transitions. [2019-11-16 00:18:47,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1426 transitions. [2019-11-16 00:18:47,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-16 00:18:47,547 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:47,548 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:47,548 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:47,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:47,548 INFO L82 PathProgramCache]: Analyzing trace with hash -694478374, now seen corresponding path program 1 times [2019-11-16 00:18:47,550 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:47,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396016971] [2019-11-16 00:18:47,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:47,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:47,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:47,639 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-16 00:18:47,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396016971] [2019-11-16 00:18:47,640 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:47,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:47,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945412441] [2019-11-16 00:18:47,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:47,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:47,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:47,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:47,641 INFO L87 Difference]: Start difference. First operand 962 states and 1426 transitions. Second operand 4 states. [2019-11-16 00:18:48,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:48,222 INFO L93 Difference]: Finished difference Result 2323 states and 3438 transitions. [2019-11-16 00:18:48,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:48,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-16 00:18:48,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:48,230 INFO L225 Difference]: With dead ends: 2323 [2019-11-16 00:18:48,230 INFO L226 Difference]: Without dead ends: 1371 [2019-11-16 00:18:48,232 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:48,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2019-11-16 00:18:48,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 968. [2019-11-16 00:18:48,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-11-16 00:18:48,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1432 transitions. [2019-11-16 00:18:48,262 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1432 transitions. Word has length 150 [2019-11-16 00:18:48,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:48,263 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1432 transitions. [2019-11-16 00:18:48,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:48,263 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1432 transitions. [2019-11-16 00:18:48,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-16 00:18:48,266 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:48,266 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 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, 1, 1] [2019-11-16 00:18:48,267 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:48,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:48,267 INFO L82 PathProgramCache]: Analyzing trace with hash -820055315, now seen corresponding path program 2 times [2019-11-16 00:18:48,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:48,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986967508] [2019-11-16 00:18:48,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:48,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:48,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:48,363 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-16 00:18:48,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986967508] [2019-11-16 00:18:48,364 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:48,364 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:48,364 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929771549] [2019-11-16 00:18:48,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:48,365 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:48,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:48,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:48,365 INFO L87 Difference]: Start difference. First operand 968 states and 1432 transitions. Second operand 4 states. [2019-11-16 00:18:48,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:48,910 INFO L93 Difference]: Finished difference Result 2323 states and 3432 transitions. [2019-11-16 00:18:48,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:48,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-16 00:18:48,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:48,917 INFO L225 Difference]: With dead ends: 2323 [2019-11-16 00:18:48,917 INFO L226 Difference]: Without dead ends: 1365 [2019-11-16 00:18:48,919 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:48,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2019-11-16 00:18:48,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 968. [2019-11-16 00:18:48,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-11-16 00:18:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1426 transitions. [2019-11-16 00:18:48,949 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1426 transitions. Word has length 163 [2019-11-16 00:18:48,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:48,950 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1426 transitions. [2019-11-16 00:18:48,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:48,950 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1426 transitions. [2019-11-16 00:18:48,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-16 00:18:48,953 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:48,953 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:48,954 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:48,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:48,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1358064885, now seen corresponding path program 1 times [2019-11-16 00:18:48,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:48,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551677096] [2019-11-16 00:18:48,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:48,957 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:48,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-16 00:18:49,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551677096] [2019-11-16 00:18:49,046 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:49,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:49,046 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312026871] [2019-11-16 00:18:49,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:49,047 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:49,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:49,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:49,047 INFO L87 Difference]: Start difference. First operand 968 states and 1426 transitions. Second operand 4 states. [2019-11-16 00:18:49,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:49,515 INFO L93 Difference]: Finished difference Result 2323 states and 3420 transitions. [2019-11-16 00:18:49,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:49,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-16 00:18:49,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:49,523 INFO L225 Difference]: With dead ends: 2323 [2019-11-16 00:18:49,524 INFO L226 Difference]: Without dead ends: 1365 [2019-11-16 00:18:49,525 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:49,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2019-11-16 00:18:49,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 968. [2019-11-16 00:18:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-11-16 00:18:49,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1420 transitions. [2019-11-16 00:18:49,563 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1420 transitions. Word has length 163 [2019-11-16 00:18:49,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:49,563 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1420 transitions. [2019-11-16 00:18:49,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1420 transitions. [2019-11-16 00:18:49,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-16 00:18:49,567 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:49,567 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:49,567 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:49,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:49,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1629073856, now seen corresponding path program 1 times [2019-11-16 00:18:49,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:49,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812997728] [2019-11-16 00:18:49,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:49,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:49,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:49,659 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-16 00:18:49,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812997728] [2019-11-16 00:18:49,660 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:49,660 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:49,660 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538382831] [2019-11-16 00:18:49,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:49,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:49,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:49,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:49,665 INFO L87 Difference]: Start difference. First operand 968 states and 1420 transitions. Second operand 4 states. [2019-11-16 00:18:50,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:50,092 INFO L93 Difference]: Finished difference Result 2323 states and 3408 transitions. [2019-11-16 00:18:50,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:50,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-11-16 00:18:50,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:50,100 INFO L225 Difference]: With dead ends: 2323 [2019-11-16 00:18:50,100 INFO L226 Difference]: Without dead ends: 1365 [2019-11-16 00:18:50,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-16 00:18:50,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2019-11-16 00:18:50,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 968. [2019-11-16 00:18:50,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-11-16 00:18:50,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1414 transitions. [2019-11-16 00:18:50,134 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1414 transitions. Word has length 164 [2019-11-16 00:18:50,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:50,134 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1414 transitions. [2019-11-16 00:18:50,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:50,135 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1414 transitions. [2019-11-16 00:18:50,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-16 00:18:50,138 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:50,138 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2019-11-16 00:18:50,138 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:50,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:50,139 INFO L82 PathProgramCache]: Analyzing trace with hash -332229371, now seen corresponding path program 1 times [2019-11-16 00:18:50,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:50,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055057498] [2019-11-16 00:18:50,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:50,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:50,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-16 00:18:50,218 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055057498] [2019-11-16 00:18:50,219 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:50,219 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:50,219 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638353632] [2019-11-16 00:18:50,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:50,220 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:50,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:50,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:50,220 INFO L87 Difference]: Start difference. First operand 968 states and 1414 transitions. Second operand 4 states. [2019-11-16 00:18:50,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:50,647 INFO L93 Difference]: Finished difference Result 2159 states and 3159 transitions. [2019-11-16 00:18:50,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:50,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-11-16 00:18:50,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:50,656 INFO L225 Difference]: With dead ends: 2159 [2019-11-16 00:18:50,656 INFO L226 Difference]: Without dead ends: 1365 [2019-11-16 00:18:50,658 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2019-11-16 00:18:50,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 968. [2019-11-16 00:18:50,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-11-16 00:18:50,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1408 transitions. [2019-11-16 00:18:50,694 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1408 transitions. Word has length 164 [2019-11-16 00:18:50,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:50,695 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1408 transitions. [2019-11-16 00:18:50,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:50,695 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1408 transitions. [2019-11-16 00:18:50,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-16 00:18:50,699 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:50,699 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:50,700 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:50,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:50,700 INFO L82 PathProgramCache]: Analyzing trace with hash 995677296, now seen corresponding path program 1 times [2019-11-16 00:18:50,700 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:50,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988942370] [2019-11-16 00:18:50,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:50,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:50,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:50,827 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-16 00:18:50,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988942370] [2019-11-16 00:18:50,828 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:50,828 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:50,828 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129153588] [2019-11-16 00:18:50,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:50,829 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:50,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:50,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:50,829 INFO L87 Difference]: Start difference. First operand 968 states and 1408 transitions. Second operand 4 states. [2019-11-16 00:18:51,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:51,345 INFO L93 Difference]: Finished difference Result 2323 states and 3384 transitions. [2019-11-16 00:18:51,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:51,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-11-16 00:18:51,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:51,353 INFO L225 Difference]: With dead ends: 2323 [2019-11-16 00:18:51,354 INFO L226 Difference]: Without dead ends: 1365 [2019-11-16 00:18:51,355 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:51,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2019-11-16 00:18:51,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 968. [2019-11-16 00:18:51,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-11-16 00:18:51,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1402 transitions. [2019-11-16 00:18:51,383 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1402 transitions. Word has length 165 [2019-11-16 00:18:51,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:51,383 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1402 transitions. [2019-11-16 00:18:51,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:51,383 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1402 transitions. [2019-11-16 00:18:51,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-16 00:18:51,386 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:51,386 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:51,387 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:51,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:51,387 INFO L82 PathProgramCache]: Analyzing trace with hash -704525392, now seen corresponding path program 1 times [2019-11-16 00:18:51,387 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:51,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957770427] [2019-11-16 00:18:51,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:51,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:51,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:51,471 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-16 00:18:51,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957770427] [2019-11-16 00:18:51,471 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:51,472 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:51,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741124899] [2019-11-16 00:18:51,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:51,472 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:51,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:51,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:51,473 INFO L87 Difference]: Start difference. First operand 968 states and 1402 transitions. Second operand 4 states. [2019-11-16 00:18:51,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:51,996 INFO L93 Difference]: Finished difference Result 2142 states and 3116 transitions. [2019-11-16 00:18:51,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:51,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-11-16 00:18:51,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:52,003 INFO L225 Difference]: With dead ends: 2142 [2019-11-16 00:18:52,004 INFO L226 Difference]: Without dead ends: 1348 [2019-11-16 00:18:52,006 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:52,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2019-11-16 00:18:52,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 968. [2019-11-16 00:18:52,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-11-16 00:18:52,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1396 transitions. [2019-11-16 00:18:52,035 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1396 transitions. Word has length 165 [2019-11-16 00:18:52,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:52,036 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1396 transitions. [2019-11-16 00:18:52,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:52,036 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1396 transitions. [2019-11-16 00:18:52,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-16 00:18:52,041 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:52,041 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:52,042 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:52,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:52,042 INFO L82 PathProgramCache]: Analyzing trace with hash -205163899, now seen corresponding path program 1 times [2019-11-16 00:18:52,042 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:52,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232562406] [2019-11-16 00:18:52,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:52,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:52,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:52,122 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-16 00:18:52,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232562406] [2019-11-16 00:18:52,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:52,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:52,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654746386] [2019-11-16 00:18:52,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:52,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:52,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:52,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:52,124 INFO L87 Difference]: Start difference. First operand 968 states and 1396 transitions. Second operand 4 states. [2019-11-16 00:18:52,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:52,502 INFO L93 Difference]: Finished difference Result 2252 states and 3273 transitions. [2019-11-16 00:18:52,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:52,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-11-16 00:18:52,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:52,512 INFO L225 Difference]: With dead ends: 2252 [2019-11-16 00:18:52,512 INFO L226 Difference]: Without dead ends: 1294 [2019-11-16 00:18:52,514 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:52,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2019-11-16 00:18:52,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 968. [2019-11-16 00:18:52,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-11-16 00:18:52,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1390 transitions. [2019-11-16 00:18:52,544 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1390 transitions. Word has length 166 [2019-11-16 00:18:52,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:52,544 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1390 transitions. [2019-11-16 00:18:52,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:52,544 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1390 transitions. [2019-11-16 00:18:52,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-16 00:18:52,548 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:52,548 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:52,548 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:52,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:52,549 INFO L82 PathProgramCache]: Analyzing trace with hash 405875924, now seen corresponding path program 3 times [2019-11-16 00:18:52,549 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:52,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201053661] [2019-11-16 00:18:52,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:52,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:52,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:52,657 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 252 proven. 4 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:18:52,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201053661] [2019-11-16 00:18:52,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518281339] [2019-11-16 00:18:52,658 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:18:52,840 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-16 00:18:52,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:18:52,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:18:52,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:18:52,951 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:18:52,952 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:18:52,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:18:52,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:18:52,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:18:52,959 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-16 00:18:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-11-16 00:18:53,038 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:18:53,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-16 00:18:53,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932780432] [2019-11-16 00:18:53,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:53,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:53,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:53,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:18:53,040 INFO L87 Difference]: Start difference. First operand 968 states and 1390 transitions. Second operand 4 states. [2019-11-16 00:18:53,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:53,415 INFO L93 Difference]: Finished difference Result 2210 states and 3192 transitions. [2019-11-16 00:18:53,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:53,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-11-16 00:18:53,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:53,435 INFO L225 Difference]: With dead ends: 2210 [2019-11-16 00:18:53,441 INFO L226 Difference]: Without dead ends: 1252 [2019-11-16 00:18:53,442 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:18:53,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2019-11-16 00:18:53,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1100. [2019-11-16 00:18:53,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1100 states. [2019-11-16 00:18:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1618 transitions. [2019-11-16 00:18:53,485 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1618 transitions. Word has length 167 [2019-11-16 00:18:53,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:53,485 INFO L462 AbstractCegarLoop]: Abstraction has 1100 states and 1618 transitions. [2019-11-16 00:18:53,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:53,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1618 transitions. [2019-11-16 00:18:53,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-16 00:18:53,489 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:53,489 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:53,700 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:18:53,700 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:53,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:53,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1607682332, now seen corresponding path program 1 times [2019-11-16 00:18:53,701 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:53,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977758321] [2019-11-16 00:18:53,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:53,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:53,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:53,880 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 252 proven. 4 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-11-16 00:18:53,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977758321] [2019-11-16 00:18:53,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695579843] [2019-11-16 00:18:53,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:18:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:54,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:18:54,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:18:54,116 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:18:54,116 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:18:54,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:18:54,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:18:54,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:18:54,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-16 00:18:54,163 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:18:54,163 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-16 00:18:54,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:18:54,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:18:54,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:18:54,166 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2019-11-16 00:18:54,208 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-11-16 00:18:54,208 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:18:54,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-16 00:18:54,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823686327] [2019-11-16 00:18:54,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:54,209 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:54,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:54,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:18:54,210 INFO L87 Difference]: Start difference. First operand 1100 states and 1618 transitions. Second operand 4 states. [2019-11-16 00:18:54,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:54,813 INFO L93 Difference]: Finished difference Result 2516 states and 3717 transitions. [2019-11-16 00:18:54,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:54,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-11-16 00:18:54,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:54,817 INFO L225 Difference]: With dead ends: 2516 [2019-11-16 00:18:54,817 INFO L226 Difference]: Without dead ends: 1426 [2019-11-16 00:18:54,818 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:18:54,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2019-11-16 00:18:54,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1106. [2019-11-16 00:18:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106 states. [2019-11-16 00:18:54,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1624 transitions. [2019-11-16 00:18:54,849 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1624 transitions. Word has length 170 [2019-11-16 00:18:54,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:54,850 INFO L462 AbstractCegarLoop]: Abstraction has 1106 states and 1624 transitions. [2019-11-16 00:18:54,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:54,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1624 transitions. [2019-11-16 00:18:54,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-16 00:18:54,854 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:54,854 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:55,059 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:18:55,067 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:55,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:55,067 INFO L82 PathProgramCache]: Analyzing trace with hash 2065588807, now seen corresponding path program 1 times [2019-11-16 00:18:55,067 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:55,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755582072] [2019-11-16 00:18:55,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:55,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:55,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:55,215 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 254 proven. 5 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-11-16 00:18:55,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755582072] [2019-11-16 00:18:55,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379760771] [2019-11-16 00:18:55,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:18:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:55,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:18:55,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:18:55,421 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:18:55,421 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:18:55,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:18:55,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:18:55,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:18:55,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-16 00:18:55,448 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:18:55,449 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-16 00:18:55,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:18:55,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:18:55,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:18:55,452 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2019-11-16 00:18:55,488 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-11-16 00:18:55,489 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:18:55,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-16 00:18:55,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389892995] [2019-11-16 00:18:55,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:55,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:55,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:55,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:18:55,490 INFO L87 Difference]: Start difference. First operand 1106 states and 1624 transitions. Second operand 4 states. [2019-11-16 00:18:55,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:55,865 INFO L93 Difference]: Finished difference Result 2492 states and 3677 transitions. [2019-11-16 00:18:55,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:55,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-11-16 00:18:55,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:55,869 INFO L225 Difference]: With dead ends: 2492 [2019-11-16 00:18:55,869 INFO L226 Difference]: Without dead ends: 1396 [2019-11-16 00:18:55,870 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:18:55,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2019-11-16 00:18:55,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1112. [2019-11-16 00:18:55,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2019-11-16 00:18:55,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1630 transitions. [2019-11-16 00:18:55,902 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1630 transitions. Word has length 171 [2019-11-16 00:18:55,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:55,903 INFO L462 AbstractCegarLoop]: Abstraction has 1112 states and 1630 transitions. [2019-11-16 00:18:55,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:55,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1630 transitions. [2019-11-16 00:18:55,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-16 00:18:55,906 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:55,907 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:56,111 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:18:56,111 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:56,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:56,111 INFO L82 PathProgramCache]: Analyzing trace with hash 390685614, now seen corresponding path program 1 times [2019-11-16 00:18:56,111 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:56,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212591471] [2019-11-16 00:18:56,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:56,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:56,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:56,194 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-11-16 00:18:56,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212591471] [2019-11-16 00:18:56,195 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:56,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:56,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751398033] [2019-11-16 00:18:56,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:56,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:56,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:56,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:56,197 INFO L87 Difference]: Start difference. First operand 1112 states and 1630 transitions. Second operand 4 states. [2019-11-16 00:18:56,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:56,572 INFO L93 Difference]: Finished difference Result 2758 states and 4070 transitions. [2019-11-16 00:18:56,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:56,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-11-16 00:18:56,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:56,575 INFO L225 Difference]: With dead ends: 2758 [2019-11-16 00:18:56,575 INFO L226 Difference]: Without dead ends: 1656 [2019-11-16 00:18:56,577 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:56,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2019-11-16 00:18:56,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1220. [2019-11-16 00:18:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2019-11-16 00:18:56,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1810 transitions. [2019-11-16 00:18:56,610 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1810 transitions. Word has length 174 [2019-11-16 00:18:56,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:56,611 INFO L462 AbstractCegarLoop]: Abstraction has 1220 states and 1810 transitions. [2019-11-16 00:18:56,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:56,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1810 transitions. [2019-11-16 00:18:56,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-16 00:18:56,615 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:56,615 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:56,615 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:56,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:56,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1811485395, now seen corresponding path program 1 times [2019-11-16 00:18:56,616 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:56,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212207549] [2019-11-16 00:18:56,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:56,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:56,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:56,702 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 262 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-11-16 00:18:56,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212207549] [2019-11-16 00:18:56,702 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:56,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:56,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753907245] [2019-11-16 00:18:56,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:56,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:56,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:56,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:56,704 INFO L87 Difference]: Start difference. First operand 1220 states and 1810 transitions. Second operand 4 states. [2019-11-16 00:18:57,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:57,284 INFO L93 Difference]: Finished difference Result 2839 states and 4206 transitions. [2019-11-16 00:18:57,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:57,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-11-16 00:18:57,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:57,288 INFO L225 Difference]: With dead ends: 2839 [2019-11-16 00:18:57,288 INFO L226 Difference]: Without dead ends: 1629 [2019-11-16 00:18:57,290 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:57,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2019-11-16 00:18:57,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1226. [2019-11-16 00:18:57,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2019-11-16 00:18:57,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1816 transitions. [2019-11-16 00:18:57,330 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1816 transitions. Word has length 175 [2019-11-16 00:18:57,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:57,331 INFO L462 AbstractCegarLoop]: Abstraction has 1226 states and 1816 transitions. [2019-11-16 00:18:57,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:57,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1816 transitions. [2019-11-16 00:18:57,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-16 00:18:57,335 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:57,335 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:57,335 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:57,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:57,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1575562843, now seen corresponding path program 1 times [2019-11-16 00:18:57,336 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:57,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193244389] [2019-11-16 00:18:57,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:57,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:57,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:57,483 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-11-16 00:18:57,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193244389] [2019-11-16 00:18:57,483 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:57,483 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:57,484 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746891085] [2019-11-16 00:18:57,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:57,485 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:57,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:57,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:57,486 INFO L87 Difference]: Start difference. First operand 1226 states and 1816 transitions. Second operand 4 states. [2019-11-16 00:18:57,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:57,746 INFO L93 Difference]: Finished difference Result 2498 states and 3695 transitions. [2019-11-16 00:18:57,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:57,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-11-16 00:18:57,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:57,749 INFO L225 Difference]: With dead ends: 2498 [2019-11-16 00:18:57,749 INFO L226 Difference]: Without dead ends: 1282 [2019-11-16 00:18:57,750 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:57,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2019-11-16 00:18:57,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1244. [2019-11-16 00:18:57,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1244 states. [2019-11-16 00:18:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1846 transitions. [2019-11-16 00:18:57,780 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1846 transitions. Word has length 177 [2019-11-16 00:18:57,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:57,781 INFO L462 AbstractCegarLoop]: Abstraction has 1244 states and 1846 transitions. [2019-11-16 00:18:57,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:57,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1846 transitions. [2019-11-16 00:18:57,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-16 00:18:57,786 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:57,786 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:57,786 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:57,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:57,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1035728646, now seen corresponding path program 2 times [2019-11-16 00:18:57,787 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:57,787 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699016359] [2019-11-16 00:18:57,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:57,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:57,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:57,878 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-16 00:18:57,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699016359] [2019-11-16 00:18:57,879 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:57,879 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:57,879 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601278081] [2019-11-16 00:18:57,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:57,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:57,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:57,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:57,880 INFO L87 Difference]: Start difference. First operand 1244 states and 1846 transitions. Second operand 4 states. [2019-11-16 00:18:58,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:58,357 INFO L93 Difference]: Finished difference Result 2875 states and 4260 transitions. [2019-11-16 00:18:58,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:58,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-11-16 00:18:58,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:58,362 INFO L225 Difference]: With dead ends: 2875 [2019-11-16 00:18:58,362 INFO L226 Difference]: Without dead ends: 1641 [2019-11-16 00:18:58,364 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:58,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2019-11-16 00:18:58,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1244. [2019-11-16 00:18:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1244 states. [2019-11-16 00:18:58,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1840 transitions. [2019-11-16 00:18:58,395 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1840 transitions. Word has length 188 [2019-11-16 00:18:58,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:58,395 INFO L462 AbstractCegarLoop]: Abstraction has 1244 states and 1840 transitions. [2019-11-16 00:18:58,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:58,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1840 transitions. [2019-11-16 00:18:58,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-16 00:18:58,398 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:58,398 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 5, 5, 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, 1, 1, 1, 1] [2019-11-16 00:18:58,398 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:58,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:58,399 INFO L82 PathProgramCache]: Analyzing trace with hash 2010577448, now seen corresponding path program 1 times [2019-11-16 00:18:58,399 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:58,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543895712] [2019-11-16 00:18:58,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:58,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:58,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:58,492 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-16 00:18:58,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543895712] [2019-11-16 00:18:58,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:58,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:58,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869234025] [2019-11-16 00:18:58,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:58,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:58,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:58,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:58,495 INFO L87 Difference]: Start difference. First operand 1244 states and 1840 transitions. Second operand 4 states. [2019-11-16 00:18:59,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:59,003 INFO L93 Difference]: Finished difference Result 2875 states and 4248 transitions. [2019-11-16 00:18:59,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:59,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-11-16 00:18:59,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:59,007 INFO L225 Difference]: With dead ends: 2875 [2019-11-16 00:18:59,008 INFO L226 Difference]: Without dead ends: 1641 [2019-11-16 00:18:59,010 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:59,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2019-11-16 00:18:59,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1244. [2019-11-16 00:18:59,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1244 states. [2019-11-16 00:18:59,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1834 transitions. [2019-11-16 00:18:59,044 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1834 transitions. Word has length 188 [2019-11-16 00:18:59,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:59,044 INFO L462 AbstractCegarLoop]: Abstraction has 1244 states and 1834 transitions. [2019-11-16 00:18:59,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:59,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1834 transitions. [2019-11-16 00:18:59,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-16 00:18:59,047 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:59,047 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 5, 5, 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, 1, 1, 1, 1] [2019-11-16 00:18:59,047 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:59,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:59,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1233750637, now seen corresponding path program 1 times [2019-11-16 00:18:59,048 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:59,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726285991] [2019-11-16 00:18:59,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:59,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:59,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:59,126 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-16 00:18:59,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726285991] [2019-11-16 00:18:59,127 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:59,127 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:59,127 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171703792] [2019-11-16 00:18:59,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:59,128 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:59,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:59,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:59,128 INFO L87 Difference]: Start difference. First operand 1244 states and 1834 transitions. Second operand 4 states. [2019-11-16 00:18:59,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:18:59,578 INFO L93 Difference]: Finished difference Result 2875 states and 4236 transitions. [2019-11-16 00:18:59,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:18:59,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-11-16 00:18:59,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:18:59,582 INFO L225 Difference]: With dead ends: 2875 [2019-11-16 00:18:59,583 INFO L226 Difference]: Without dead ends: 1641 [2019-11-16 00:18:59,584 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:18:59,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2019-11-16 00:18:59,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1244. [2019-11-16 00:18:59,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1244 states. [2019-11-16 00:18:59,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1828 transitions. [2019-11-16 00:18:59,618 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1828 transitions. Word has length 189 [2019-11-16 00:18:59,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:18:59,618 INFO L462 AbstractCegarLoop]: Abstraction has 1244 states and 1828 transitions. [2019-11-16 00:18:59,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:18:59,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1828 transitions. [2019-11-16 00:18:59,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-16 00:18:59,621 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:18:59,622 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:18:59,622 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:18:59,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:18:59,622 INFO L82 PathProgramCache]: Analyzing trace with hash 784409864, now seen corresponding path program 1 times [2019-11-16 00:18:59,622 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:18:59,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775238466] [2019-11-16 00:18:59,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:59,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:18:59,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:18:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:18:59,703 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-16 00:18:59,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775238466] [2019-11-16 00:18:59,703 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:18:59,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:18:59,704 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286434360] [2019-11-16 00:18:59,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:18:59,704 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:18:59,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:18:59,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:18:59,705 INFO L87 Difference]: Start difference. First operand 1244 states and 1828 transitions. Second operand 4 states. [2019-11-16 00:19:00,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:00,148 INFO L93 Difference]: Finished difference Result 2665 states and 3918 transitions. [2019-11-16 00:19:00,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:19:00,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-11-16 00:19:00,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:00,153 INFO L225 Difference]: With dead ends: 2665 [2019-11-16 00:19:00,153 INFO L226 Difference]: Without dead ends: 1641 [2019-11-16 00:19:00,156 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:19:00,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2019-11-16 00:19:00,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1244. [2019-11-16 00:19:00,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1244 states. [2019-11-16 00:19:00,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1822 transitions. [2019-11-16 00:19:00,191 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1822 transitions. Word has length 189 [2019-11-16 00:19:00,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:00,192 INFO L462 AbstractCegarLoop]: Abstraction has 1244 states and 1822 transitions. [2019-11-16 00:19:00,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:00,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1822 transitions. [2019-11-16 00:19:00,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-16 00:19:00,195 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:00,195 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 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, 1, 1, 1, 1] [2019-11-16 00:19:00,196 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:00,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:00,196 INFO L82 PathProgramCache]: Analyzing trace with hash -896866845, now seen corresponding path program 1 times [2019-11-16 00:19:00,196 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:00,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118851781] [2019-11-16 00:19:00,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:00,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:00,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:00,290 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-16 00:19:00,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118851781] [2019-11-16 00:19:00,290 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:00,291 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:19:00,291 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325967637] [2019-11-16 00:19:00,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:00,292 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:00,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:00,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:00,294 INFO L87 Difference]: Start difference. First operand 1244 states and 1822 transitions. Second operand 4 states. [2019-11-16 00:19:00,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:00,767 INFO L93 Difference]: Finished difference Result 2875 states and 4212 transitions. [2019-11-16 00:19:00,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:19:00,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-11-16 00:19:00,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:00,775 INFO L225 Difference]: With dead ends: 2875 [2019-11-16 00:19:00,775 INFO L226 Difference]: Without dead ends: 1641 [2019-11-16 00:19:00,776 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:19:00,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2019-11-16 00:19:00,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1244. [2019-11-16 00:19:00,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1244 states. [2019-11-16 00:19:00,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1816 transitions. [2019-11-16 00:19:00,812 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1816 transitions. Word has length 190 [2019-11-16 00:19:00,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:00,812 INFO L462 AbstractCegarLoop]: Abstraction has 1244 states and 1816 transitions. [2019-11-16 00:19:00,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:00,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1816 transitions. [2019-11-16 00:19:00,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-16 00:19:00,819 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:00,822 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:00,822 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:00,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:00,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1085823325, now seen corresponding path program 1 times [2019-11-16 00:19:00,823 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:00,823 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937828420] [2019-11-16 00:19:00,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:00,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:00,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:00,915 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 333 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-16 00:19:00,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937828420] [2019-11-16 00:19:00,916 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:00,916 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:19:00,916 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034558982] [2019-11-16 00:19:00,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:00,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:00,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:00,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:00,917 INFO L87 Difference]: Start difference. First operand 1244 states and 1816 transitions. Second operand 4 states. [2019-11-16 00:19:01,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:01,343 INFO L93 Difference]: Finished difference Result 2648 states and 3875 transitions. [2019-11-16 00:19:01,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:19:01,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-11-16 00:19:01,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:01,345 INFO L225 Difference]: With dead ends: 2648 [2019-11-16 00:19:01,345 INFO L226 Difference]: Without dead ends: 1624 [2019-11-16 00:19:01,346 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:19:01,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2019-11-16 00:19:01,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1244. [2019-11-16 00:19:01,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1244 states. [2019-11-16 00:19:01,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1810 transitions. [2019-11-16 00:19:01,379 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1810 transitions. Word has length 190 [2019-11-16 00:19:01,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:01,379 INFO L462 AbstractCegarLoop]: Abstraction has 1244 states and 1810 transitions. [2019-11-16 00:19:01,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:01,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1810 transitions. [2019-11-16 00:19:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-16 00:19:01,381 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:01,381 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 5, 5, 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, 1, 1, 1, 1] [2019-11-16 00:19:01,382 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:01,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:01,382 INFO L82 PathProgramCache]: Analyzing trace with hash -2045322168, now seen corresponding path program 1 times [2019-11-16 00:19:01,382 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:01,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037992476] [2019-11-16 00:19:01,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:01,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:01,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:01,473 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-16 00:19:01,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037992476] [2019-11-16 00:19:01,474 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:01,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:19:01,474 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247928648] [2019-11-16 00:19:01,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:01,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:01,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:01,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:01,476 INFO L87 Difference]: Start difference. First operand 1244 states and 1810 transitions. Second operand 4 states. [2019-11-16 00:19:01,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:01,998 INFO L93 Difference]: Finished difference Result 2804 states and 4101 transitions. [2019-11-16 00:19:01,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:19:01,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-11-16 00:19:01,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:02,000 INFO L225 Difference]: With dead ends: 2804 [2019-11-16 00:19:02,000 INFO L226 Difference]: Without dead ends: 1570 [2019-11-16 00:19:02,002 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:19:02,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-11-16 00:19:02,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1244. [2019-11-16 00:19:02,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1244 states. [2019-11-16 00:19:02,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1804 transitions. [2019-11-16 00:19:02,039 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1804 transitions. Word has length 191 [2019-11-16 00:19:02,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:02,040 INFO L462 AbstractCegarLoop]: Abstraction has 1244 states and 1804 transitions. [2019-11-16 00:19:02,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:02,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1804 transitions. [2019-11-16 00:19:02,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-16 00:19:02,042 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:02,043 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:02,043 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:02,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:02,044 INFO L82 PathProgramCache]: Analyzing trace with hash 978982463, now seen corresponding path program 1 times [2019-11-16 00:19:02,044 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:02,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044851154] [2019-11-16 00:19:02,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:02,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:02,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:02,143 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-16 00:19:02,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044851154] [2019-11-16 00:19:02,143 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:02,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:19:02,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728225899] [2019-11-16 00:19:02,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:02,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:02,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:02,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:02,145 INFO L87 Difference]: Start difference. First operand 1244 states and 1804 transitions. Second operand 4 states. [2019-11-16 00:19:02,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:02,500 INFO L93 Difference]: Finished difference Result 2804 states and 4089 transitions. [2019-11-16 00:19:02,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:19:02,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-16 00:19:02,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:02,502 INFO L225 Difference]: With dead ends: 2804 [2019-11-16 00:19:02,502 INFO L226 Difference]: Without dead ends: 1570 [2019-11-16 00:19:02,503 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:19:02,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-11-16 00:19:02,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1250. [2019-11-16 00:19:02,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2019-11-16 00:19:02,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1810 transitions. [2019-11-16 00:19:02,530 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1810 transitions. Word has length 192 [2019-11-16 00:19:02,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:02,530 INFO L462 AbstractCegarLoop]: Abstraction has 1250 states and 1810 transitions. [2019-11-16 00:19:02,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:02,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1810 transitions. [2019-11-16 00:19:02,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-16 00:19:02,532 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:02,532 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 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] [2019-11-16 00:19:02,533 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:02,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:02,533 INFO L82 PathProgramCache]: Analyzing trace with hash -244237948, now seen corresponding path program 1 times [2019-11-16 00:19:02,533 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:02,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431909902] [2019-11-16 00:19:02,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:02,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:02,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:02,627 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-16 00:19:02,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431909902] [2019-11-16 00:19:02,628 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:02,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:19:02,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373368709] [2019-11-16 00:19:02,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:02,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:02,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:02,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:02,629 INFO L87 Difference]: Start difference. First operand 1250 states and 1810 transitions. Second operand 4 states. [2019-11-16 00:19:02,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:02,951 INFO L93 Difference]: Finished difference Result 2780 states and 4049 transitions. [2019-11-16 00:19:02,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:19:02,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-11-16 00:19:02,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:02,953 INFO L225 Difference]: With dead ends: 2780 [2019-11-16 00:19:02,953 INFO L226 Difference]: Without dead ends: 1540 [2019-11-16 00:19:02,954 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:19:02,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2019-11-16 00:19:02,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1256. [2019-11-16 00:19:02,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-11-16 00:19:02,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1816 transitions. [2019-11-16 00:19:02,992 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1816 transitions. Word has length 193 [2019-11-16 00:19:02,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:02,992 INFO L462 AbstractCegarLoop]: Abstraction has 1256 states and 1816 transitions. [2019-11-16 00:19:02,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:02,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1816 transitions. [2019-11-16 00:19:02,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-16 00:19:02,995 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:02,995 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:02,996 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:02,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:02,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1987541214, now seen corresponding path program 1 times [2019-11-16 00:19:02,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:02,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989231508] [2019-11-16 00:19:02,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:02,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:02,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:03,194 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 361 proven. 1 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-11-16 00:19:03,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989231508] [2019-11-16 00:19:03,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716692076] [2019-11-16 00:19:03,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:03,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:19:03,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:03,466 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-16 00:19:03,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:03,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:03,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:03,469 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:19:03,495 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:19:03,496 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:19:03,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:03,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:03,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:03,502 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:19:03,524 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:19:03,524 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-16 00:19:03,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:03,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:03,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:03,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:19:03,574 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-11-16 00:19:03,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:19:03,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-16 00:19:03,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395945349] [2019-11-16 00:19:03,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:19:03,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:03,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:19:03,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:19:03,578 INFO L87 Difference]: Start difference. First operand 1256 states and 1816 transitions. Second operand 5 states. [2019-11-16 00:19:04,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:04,104 INFO L93 Difference]: Finished difference Result 2757 states and 3996 transitions. [2019-11-16 00:19:04,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:19:04,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 199 [2019-11-16 00:19:04,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:04,106 INFO L225 Difference]: With dead ends: 2757 [2019-11-16 00:19:04,107 INFO L226 Difference]: Without dead ends: 1511 [2019-11-16 00:19:04,108 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 198 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:19:04,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2019-11-16 00:19:04,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1256. [2019-11-16 00:19:04,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-11-16 00:19:04,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1811 transitions. [2019-11-16 00:19:04,148 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1811 transitions. Word has length 199 [2019-11-16 00:19:04,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:04,148 INFO L462 AbstractCegarLoop]: Abstraction has 1256 states and 1811 transitions. [2019-11-16 00:19:04,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:19:04,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1811 transitions. [2019-11-16 00:19:04,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-16 00:19:04,151 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:04,151 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:04,355 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:04,356 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:04,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:04,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1026246075, now seen corresponding path program 1 times [2019-11-16 00:19:04,356 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:04,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492524484] [2019-11-16 00:19:04,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:04,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:04,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:04,550 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 363 proven. 1 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-11-16 00:19:04,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492524484] [2019-11-16 00:19:04,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874022317] [2019-11-16 00:19:04,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:04,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:19:04,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:04,774 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-16 00:19:04,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:04,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:04,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:04,776 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:19:04,791 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:19:04,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:19:04,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:04,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:04,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:04,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:19:04,820 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:19:04,821 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-16 00:19:04,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:04,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:04,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:04,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:19:04,855 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-11-16 00:19:04,855 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:19:04,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-16 00:19:04,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461589021] [2019-11-16 00:19:04,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:19:04,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:04,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:19:04,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:19:04,856 INFO L87 Difference]: Start difference. First operand 1256 states and 1811 transitions. Second operand 5 states. [2019-11-16 00:19:05,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:05,282 INFO L93 Difference]: Finished difference Result 2742 states and 3968 transitions. [2019-11-16 00:19:05,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:19:05,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 200 [2019-11-16 00:19:05,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:05,283 INFO L225 Difference]: With dead ends: 2742 [2019-11-16 00:19:05,283 INFO L226 Difference]: Without dead ends: 1496 [2019-11-16 00:19:05,285 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 199 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:19:05,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2019-11-16 00:19:05,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1256. [2019-11-16 00:19:05,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-11-16 00:19:05,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1806 transitions. [2019-11-16 00:19:05,310 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1806 transitions. Word has length 200 [2019-11-16 00:19:05,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:05,311 INFO L462 AbstractCegarLoop]: Abstraction has 1256 states and 1806 transitions. [2019-11-16 00:19:05,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:19:05,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1806 transitions. [2019-11-16 00:19:05,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-16 00:19:05,313 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:05,313 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:05,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:05,517 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:05,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:05,517 INFO L82 PathProgramCache]: Analyzing trace with hash -111421109, now seen corresponding path program 1 times [2019-11-16 00:19:05,518 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:05,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11621531] [2019-11-16 00:19:05,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:05,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:05,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:05,726 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 367 proven. 1 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-11-16 00:19:05,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11621531] [2019-11-16 00:19:05,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884784857] [2019-11-16 00:19:05,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:05,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:19:05,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:05,905 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-16 00:19:05,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:05,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:05,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:05,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:19:05,928 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:19:05,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:19:05,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:05,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:05,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:05,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:19:05,950 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:19:05,951 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-16 00:19:05,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:05,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:05,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:05,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:19:05,997 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2019-11-16 00:19:05,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:19:05,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-16 00:19:05,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720027002] [2019-11-16 00:19:05,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:19:05,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:05,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:19:05,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:19:05,999 INFO L87 Difference]: Start difference. First operand 1256 states and 1806 transitions. Second operand 5 states. [2019-11-16 00:19:06,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:06,433 INFO L93 Difference]: Finished difference Result 3058 states and 4434 transitions. [2019-11-16 00:19:06,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:19:06,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-11-16 00:19:06,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:06,435 INFO L225 Difference]: With dead ends: 3058 [2019-11-16 00:19:06,435 INFO L226 Difference]: Without dead ends: 1812 [2019-11-16 00:19:06,436 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 202 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:19:06,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2019-11-16 00:19:06,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1406. [2019-11-16 00:19:06,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1406 states. [2019-11-16 00:19:06,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 2064 transitions. [2019-11-16 00:19:06,503 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 2064 transitions. Word has length 203 [2019-11-16 00:19:06,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:06,503 INFO L462 AbstractCegarLoop]: Abstraction has 1406 states and 2064 transitions. [2019-11-16 00:19:06,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:19:06,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 2064 transitions. [2019-11-16 00:19:06,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-16 00:19:06,505 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:06,505 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:06,706 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:06,706 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:06,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:06,706 INFO L82 PathProgramCache]: Analyzing trace with hash -245434615, now seen corresponding path program 1 times [2019-11-16 00:19:06,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:06,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694703171] [2019-11-16 00:19:06,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:06,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:06,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 367 proven. 1 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-11-16 00:19:06,903 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694703171] [2019-11-16 00:19:06,903 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839295064] [2019-11-16 00:19:06,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:07,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:19:07,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:07,134 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-16 00:19:07,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:07,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:07,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:07,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:19:07,164 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:19:07,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:19:07,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:07,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:07,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:07,169 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:19:07,187 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:19:07,188 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-16 00:19:07,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:07,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:07,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:07,190 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:19:07,222 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2019-11-16 00:19:07,222 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:19:07,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-16 00:19:07,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910589727] [2019-11-16 00:19:07,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:19:07,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:07,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:19:07,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:19:07,224 INFO L87 Difference]: Start difference. First operand 1406 states and 2064 transitions. Second operand 5 states. [2019-11-16 00:19:07,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:07,652 INFO L93 Difference]: Finished difference Result 3352 states and 4944 transitions. [2019-11-16 00:19:07,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:19:07,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-11-16 00:19:07,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:07,654 INFO L225 Difference]: With dead ends: 3352 [2019-11-16 00:19:07,654 INFO L226 Difference]: Without dead ends: 1956 [2019-11-16 00:19:07,655 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 202 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:19:07,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2019-11-16 00:19:07,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1400. [2019-11-16 00:19:07,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1400 states. [2019-11-16 00:19:07,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 2058 transitions. [2019-11-16 00:19:07,685 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 2058 transitions. Word has length 203 [2019-11-16 00:19:07,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:07,685 INFO L462 AbstractCegarLoop]: Abstraction has 1400 states and 2058 transitions. [2019-11-16 00:19:07,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:19:07,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 2058 transitions. [2019-11-16 00:19:07,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-16 00:19:07,688 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:07,688 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:07,888 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:07,889 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:07,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:07,889 INFO L82 PathProgramCache]: Analyzing trace with hash 836227088, now seen corresponding path program 1 times [2019-11-16 00:19:07,889 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:07,889 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930694632] [2019-11-16 00:19:07,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:07,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:07,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:08,079 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 368 proven. 1 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-11-16 00:19:08,079 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930694632] [2019-11-16 00:19:08,079 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104659463] [2019-11-16 00:19:08,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:08,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:19:08,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:08,301 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-16 00:19:08,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:08,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:08,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:08,303 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:19:08,326 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:19:08,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:19:08,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:08,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:08,334 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:08,334 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:19:08,354 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:19:08,354 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-16 00:19:08,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:08,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:08,357 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:08,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:19:08,403 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2019-11-16 00:19:08,403 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:19:08,404 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-16 00:19:08,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765731147] [2019-11-16 00:19:08,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:19:08,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:08,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:19:08,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:19:08,405 INFO L87 Difference]: Start difference. First operand 1400 states and 2058 transitions. Second operand 5 states. [2019-11-16 00:19:08,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:08,901 INFO L93 Difference]: Finished difference Result 3326 states and 4912 transitions. [2019-11-16 00:19:08,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:19:08,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-11-16 00:19:08,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:08,903 INFO L225 Difference]: With dead ends: 3326 [2019-11-16 00:19:08,903 INFO L226 Difference]: Without dead ends: 1936 [2019-11-16 00:19:08,904 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 203 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:19:08,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2019-11-16 00:19:08,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1546. [2019-11-16 00:19:08,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2019-11-16 00:19:08,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2312 transitions. [2019-11-16 00:19:08,935 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2312 transitions. Word has length 204 [2019-11-16 00:19:08,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:08,935 INFO L462 AbstractCegarLoop]: Abstraction has 1546 states and 2312 transitions. [2019-11-16 00:19:08,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:19:08,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2312 transitions. [2019-11-16 00:19:08,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-16 00:19:08,937 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:08,937 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:09,138 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:09,138 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:09,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:09,138 INFO L82 PathProgramCache]: Analyzing trace with hash 976775698, now seen corresponding path program 1 times [2019-11-16 00:19:09,138 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:09,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291768402] [2019-11-16 00:19:09,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:09,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:09,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:09,344 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 368 proven. 1 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-11-16 00:19:09,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291768402] [2019-11-16 00:19:09,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748001792] [2019-11-16 00:19:09,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:09,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:19:09,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:09,571 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-16 00:19:09,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:09,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:09,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:09,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:19:09,596 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:19:09,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:19:09,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:09,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:09,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:09,603 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:19:09,634 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:19:09,634 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-16 00:19:09,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:09,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:09,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:09,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:19:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2019-11-16 00:19:09,746 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:19:09,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-16 00:19:09,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955638361] [2019-11-16 00:19:09,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:19:09,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:09,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:19:09,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:19:09,748 INFO L87 Difference]: Start difference. First operand 1546 states and 2312 transitions. Second operand 5 states. [2019-11-16 00:19:10,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:10,420 INFO L93 Difference]: Finished difference Result 3468 states and 5162 transitions. [2019-11-16 00:19:10,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:19:10,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-11-16 00:19:10,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:10,423 INFO L225 Difference]: With dead ends: 3468 [2019-11-16 00:19:10,423 INFO L226 Difference]: Without dead ends: 1932 [2019-11-16 00:19:10,425 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 203 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:19:10,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2019-11-16 00:19:10,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1396. [2019-11-16 00:19:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1396 states. [2019-11-16 00:19:10,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 2054 transitions. [2019-11-16 00:19:10,463 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 2054 transitions. Word has length 204 [2019-11-16 00:19:10,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:10,463 INFO L462 AbstractCegarLoop]: Abstraction has 1396 states and 2054 transitions. [2019-11-16 00:19:10,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:19:10,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 2054 transitions. [2019-11-16 00:19:10,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-16 00:19:10,465 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:10,465 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:10,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:10,669 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:10,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:10,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1368967930, now seen corresponding path program 1 times [2019-11-16 00:19:10,670 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:10,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839706992] [2019-11-16 00:19:10,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:10,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:10,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:10,866 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 363 proven. 1 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-11-16 00:19:10,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839706992] [2019-11-16 00:19:10,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919598708] [2019-11-16 00:19:10,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:11,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:19:11,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:11,104 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-16 00:19:11,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:11,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:11,107 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:11,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:19:11,126 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:19:11,126 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:19:11,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:11,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:11,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:11,132 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:19:11,151 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:19:11,151 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-16 00:19:11,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:11,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:11,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:11,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:19:11,200 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2019-11-16 00:19:11,200 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:19:11,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-16 00:19:11,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840473501] [2019-11-16 00:19:11,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:19:11,201 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:11,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:19:11,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:19:11,202 INFO L87 Difference]: Start difference. First operand 1396 states and 2054 transitions. Second operand 5 states. [2019-11-16 00:19:11,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:11,938 INFO L93 Difference]: Finished difference Result 3338 states and 4930 transitions. [2019-11-16 00:19:11,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:19:11,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 209 [2019-11-16 00:19:11,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:11,940 INFO L225 Difference]: With dead ends: 3338 [2019-11-16 00:19:11,940 INFO L226 Difference]: Without dead ends: 1952 [2019-11-16 00:19:11,941 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 208 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:19:11,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2019-11-16 00:19:11,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1546. [2019-11-16 00:19:11,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2019-11-16 00:19:11,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2312 transitions. [2019-11-16 00:19:11,978 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2312 transitions. Word has length 209 [2019-11-16 00:19:11,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:11,978 INFO L462 AbstractCegarLoop]: Abstraction has 1546 states and 2312 transitions. [2019-11-16 00:19:11,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:19:11,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2312 transitions. [2019-11-16 00:19:11,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-16 00:19:11,981 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:11,981 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:12,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:12,185 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:12,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:12,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1234954424, now seen corresponding path program 1 times [2019-11-16 00:19:12,186 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:12,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47969651] [2019-11-16 00:19:12,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:12,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:12,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 363 proven. 1 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-11-16 00:19:12,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47969651] [2019-11-16 00:19:12,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164658183] [2019-11-16 00:19:12,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:12,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:19:12,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:12,597 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-16 00:19:12,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:12,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:12,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:12,599 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:19:12,629 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:19:12,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:19:12,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:12,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:12,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:12,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:19:12,655 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:19:12,655 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-16 00:19:12,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:12,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:12,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:12,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:19:12,688 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2019-11-16 00:19:12,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:19:12,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-16 00:19:12,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979657788] [2019-11-16 00:19:12,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:19:12,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:12,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:19:12,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:19:12,690 INFO L87 Difference]: Start difference. First operand 1546 states and 2312 transitions. Second operand 5 states. [2019-11-16 00:19:13,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:13,088 INFO L93 Difference]: Finished difference Result 3618 states and 5414 transitions. [2019-11-16 00:19:13,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:19:13,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 209 [2019-11-16 00:19:13,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:13,090 INFO L225 Difference]: With dead ends: 3618 [2019-11-16 00:19:13,090 INFO L226 Difference]: Without dead ends: 2082 [2019-11-16 00:19:13,091 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 208 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:19:13,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2019-11-16 00:19:13,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 1660. [2019-11-16 00:19:13,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-11-16 00:19:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2498 transitions. [2019-11-16 00:19:13,126 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 2498 transitions. Word has length 209 [2019-11-16 00:19:13,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:13,126 INFO L462 AbstractCegarLoop]: Abstraction has 1660 states and 2498 transitions. [2019-11-16 00:19:13,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:19:13,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 2498 transitions. [2019-11-16 00:19:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-16 00:19:13,128 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:13,128 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:13,329 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:13,329 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:13,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:13,329 INFO L82 PathProgramCache]: Analyzing trace with hash 2122177270, now seen corresponding path program 1 times [2019-11-16 00:19:13,329 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:13,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983973224] [2019-11-16 00:19:13,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:13,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:13,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:13,506 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2019-11-16 00:19:13,506 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983973224] [2019-11-16 00:19:13,506 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:13,506 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:19:13,506 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639953633] [2019-11-16 00:19:13,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:19:13,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:13,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:19:13,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:19:13,507 INFO L87 Difference]: Start difference. First operand 1660 states and 2498 transitions. Second operand 6 states. [2019-11-16 00:19:14,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:14,192 INFO L93 Difference]: Finished difference Result 4270 states and 6412 transitions. [2019-11-16 00:19:14,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:19:14,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 209 [2019-11-16 00:19:14,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:14,194 INFO L225 Difference]: With dead ends: 4270 [2019-11-16 00:19:14,194 INFO L226 Difference]: Without dead ends: 2620 [2019-11-16 00:19:14,196 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:19:14,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2620 states. [2019-11-16 00:19:14,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2620 to 1894. [2019-11-16 00:19:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1894 states. [2019-11-16 00:19:14,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2912 transitions. [2019-11-16 00:19:14,236 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2912 transitions. Word has length 209 [2019-11-16 00:19:14,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:14,236 INFO L462 AbstractCegarLoop]: Abstraction has 1894 states and 2912 transitions. [2019-11-16 00:19:14,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:19:14,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2912 transitions. [2019-11-16 00:19:14,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-16 00:19:14,239 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:14,239 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:14,239 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:14,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:14,239 INFO L82 PathProgramCache]: Analyzing trace with hash 863228088, now seen corresponding path program 1 times [2019-11-16 00:19:14,240 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:14,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316264468] [2019-11-16 00:19:14,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:14,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:14,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:14,436 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 365 proven. 1 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:19:14,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316264468] [2019-11-16 00:19:14,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768611546] [2019-11-16 00:19:14,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:14,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:19:14,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:14,644 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-16 00:19:14,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:14,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:14,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:14,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:19:14,663 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:19:14,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:19:14,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:14,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:14,672 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:14,672 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:19:14,685 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:19:14,685 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-16 00:19:14,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:14,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:14,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:14,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:19:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2019-11-16 00:19:14,737 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:19:14,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-16 00:19:14,737 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338872882] [2019-11-16 00:19:14,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:19:14,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:14,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:19:14,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:19:14,738 INFO L87 Difference]: Start difference. First operand 1894 states and 2912 transitions. Second operand 5 states. [2019-11-16 00:19:15,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:15,292 INFO L93 Difference]: Finished difference Result 4141 states and 6316 transitions. [2019-11-16 00:19:15,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:19:15,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-11-16 00:19:15,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:15,294 INFO L225 Difference]: With dead ends: 4141 [2019-11-16 00:19:15,294 INFO L226 Difference]: Without dead ends: 2257 [2019-11-16 00:19:15,296 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 209 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:19:15,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2019-11-16 00:19:15,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 1894. [2019-11-16 00:19:15,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1894 states. [2019-11-16 00:19:15,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2906 transitions. [2019-11-16 00:19:15,338 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2906 transitions. Word has length 210 [2019-11-16 00:19:15,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:15,338 INFO L462 AbstractCegarLoop]: Abstraction has 1894 states and 2906 transitions. [2019-11-16 00:19:15,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:19:15,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2906 transitions. [2019-11-16 00:19:15,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-16 00:19:15,340 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:15,341 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:15,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:15,541 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:15,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:15,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1697634758, now seen corresponding path program 1 times [2019-11-16 00:19:15,541 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:15,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928251837] [2019-11-16 00:19:15,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:15,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:15,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:15,737 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 365 proven. 1 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:19:15,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928251837] [2019-11-16 00:19:15,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603714784] [2019-11-16 00:19:15,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:15,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:19:15,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:15,938 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-16 00:19:15,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:15,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:15,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:15,942 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:19:15,960 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:19:15,961 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:19:15,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:15,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:15,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:15,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:19:15,994 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:19:15,995 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-16 00:19:15,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:15,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:15,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:15,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:19:16,042 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2019-11-16 00:19:16,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:19:16,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-16 00:19:16,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338076430] [2019-11-16 00:19:16,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:19:16,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:16,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:19:16,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:19:16,044 INFO L87 Difference]: Start difference. First operand 1894 states and 2906 transitions. Second operand 5 states. [2019-11-16 00:19:16,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:16,583 INFO L93 Difference]: Finished difference Result 4131 states and 6300 transitions. [2019-11-16 00:19:16,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:19:16,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-11-16 00:19:16,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:16,585 INFO L225 Difference]: With dead ends: 4131 [2019-11-16 00:19:16,586 INFO L226 Difference]: Without dead ends: 2247 [2019-11-16 00:19:16,587 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 209 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:19:16,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2019-11-16 00:19:16,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 1894. [2019-11-16 00:19:16,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1894 states. [2019-11-16 00:19:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2900 transitions. [2019-11-16 00:19:16,629 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2900 transitions. Word has length 210 [2019-11-16 00:19:16,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:16,629 INFO L462 AbstractCegarLoop]: Abstraction has 1894 states and 2900 transitions. [2019-11-16 00:19:16,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:19:16,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2900 transitions. [2019-11-16 00:19:16,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-11-16 00:19:16,631 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:16,631 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:16,832 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:16,832 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:16,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:16,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1646442539, now seen corresponding path program 1 times [2019-11-16 00:19:16,833 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:16,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336925362] [2019-11-16 00:19:16,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:16,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:16,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:16,937 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-11-16 00:19:16,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336925362] [2019-11-16 00:19:16,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:16,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:19:16,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912100916] [2019-11-16 00:19:16,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:16,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:16,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:16,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:16,940 INFO L87 Difference]: Start difference. First operand 1894 states and 2900 transitions. Second operand 4 states. [2019-11-16 00:19:17,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:17,252 INFO L93 Difference]: Finished difference Result 3864 states and 5911 transitions. [2019-11-16 00:19:17,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:19:17,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 215 [2019-11-16 00:19:17,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:17,254 INFO L225 Difference]: With dead ends: 3864 [2019-11-16 00:19:17,254 INFO L226 Difference]: Without dead ends: 1980 [2019-11-16 00:19:17,256 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:19:17,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2019-11-16 00:19:17,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1924. [2019-11-16 00:19:17,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1924 states. [2019-11-16 00:19:17,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2954 transitions. [2019-11-16 00:19:17,358 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2954 transitions. Word has length 215 [2019-11-16 00:19:17,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:17,358 INFO L462 AbstractCegarLoop]: Abstraction has 1924 states and 2954 transitions. [2019-11-16 00:19:17,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:17,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2954 transitions. [2019-11-16 00:19:17,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-16 00:19:17,361 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:17,361 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:17,361 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:17,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:17,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1297716077, now seen corresponding path program 1 times [2019-11-16 00:19:17,362 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:17,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551765984] [2019-11-16 00:19:17,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:17,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:17,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2019-11-16 00:19:17,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551765984] [2019-11-16 00:19:17,498 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:17,498 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:19:17,498 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429502341] [2019-11-16 00:19:17,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:17,499 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:17,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:17,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:17,499 INFO L87 Difference]: Start difference. First operand 1924 states and 2954 transitions. Second operand 4 states. [2019-11-16 00:19:17,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:17,907 INFO L93 Difference]: Finished difference Result 4083 states and 6254 transitions. [2019-11-16 00:19:17,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:19:17,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2019-11-16 00:19:17,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:17,910 INFO L225 Difference]: With dead ends: 4083 [2019-11-16 00:19:17,910 INFO L226 Difference]: Without dead ends: 2169 [2019-11-16 00:19:17,912 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:19:17,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states. [2019-11-16 00:19:17,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 1979. [2019-11-16 00:19:17,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1979 states. [2019-11-16 00:19:17,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1979 states and 3044 transitions. [2019-11-16 00:19:17,968 INFO L78 Accepts]: Start accepts. Automaton has 1979 states and 3044 transitions. Word has length 223 [2019-11-16 00:19:17,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:17,968 INFO L462 AbstractCegarLoop]: Abstraction has 1979 states and 3044 transitions. [2019-11-16 00:19:17,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:17,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 3044 transitions. [2019-11-16 00:19:17,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-16 00:19:17,972 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:17,972 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:17,972 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:17,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:17,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1367144419, now seen corresponding path program 1 times [2019-11-16 00:19:17,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:17,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725565823] [2019-11-16 00:19:17,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:17,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:17,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:18,105 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2019-11-16 00:19:18,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725565823] [2019-11-16 00:19:18,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:18,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:19:18,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850847155] [2019-11-16 00:19:18,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:18,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:18,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:18,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:18,107 INFO L87 Difference]: Start difference. First operand 1979 states and 3044 transitions. Second operand 4 states. [2019-11-16 00:19:18,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:18,490 INFO L93 Difference]: Finished difference Result 4123 states and 6319 transitions. [2019-11-16 00:19:18,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:19:18,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 224 [2019-11-16 00:19:18,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:18,492 INFO L225 Difference]: With dead ends: 4123 [2019-11-16 00:19:18,493 INFO L226 Difference]: Without dead ends: 2154 [2019-11-16 00:19:18,494 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:19:18,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2019-11-16 00:19:18,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1979. [2019-11-16 00:19:18,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1979 states. [2019-11-16 00:19:18,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1979 states and 3039 transitions. [2019-11-16 00:19:18,556 INFO L78 Accepts]: Start accepts. Automaton has 1979 states and 3039 transitions. Word has length 224 [2019-11-16 00:19:18,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:18,557 INFO L462 AbstractCegarLoop]: Abstraction has 1979 states and 3039 transitions. [2019-11-16 00:19:18,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:18,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 3039 transitions. [2019-11-16 00:19:18,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-16 00:19:18,559 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:18,560 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:18,560 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:18,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:18,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1567273478, now seen corresponding path program 1 times [2019-11-16 00:19:18,560 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:18,560 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896578506] [2019-11-16 00:19:18,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:18,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:18,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:18,680 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2019-11-16 00:19:18,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896578506] [2019-11-16 00:19:18,680 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:18,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:19:18,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031697547] [2019-11-16 00:19:18,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:18,681 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:18,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:18,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:18,682 INFO L87 Difference]: Start difference. First operand 1979 states and 3039 transitions. Second operand 4 states. [2019-11-16 00:19:19,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:19,036 INFO L93 Difference]: Finished difference Result 4113 states and 6299 transitions. [2019-11-16 00:19:19,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:19:19,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 224 [2019-11-16 00:19:19,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:19,039 INFO L225 Difference]: With dead ends: 4113 [2019-11-16 00:19:19,039 INFO L226 Difference]: Without dead ends: 2144 [2019-11-16 00:19:19,041 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:19:19,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2144 states. [2019-11-16 00:19:19,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2144 to 1984. [2019-11-16 00:19:19,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1984 states. [2019-11-16 00:19:19,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 3044 transitions. [2019-11-16 00:19:19,097 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 3044 transitions. Word has length 224 [2019-11-16 00:19:19,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:19,097 INFO L462 AbstractCegarLoop]: Abstraction has 1984 states and 3044 transitions. [2019-11-16 00:19:19,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:19,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 3044 transitions. [2019-11-16 00:19:19,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-16 00:19:19,101 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:19,101 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 9, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:19,101 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:19,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:19,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1973602126, now seen corresponding path program 1 times [2019-11-16 00:19:19,102 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:19,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259439304] [2019-11-16 00:19:19,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:19,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:19,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:19,218 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 236 proven. 44 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2019-11-16 00:19:19,219 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259439304] [2019-11-16 00:19:19,219 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222517884] [2019-11-16 00:19:19,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:19,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:19:19,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:19,450 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-16 00:19:19,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:19,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:19,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:19,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-16 00:19:19,470 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:19:19,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:19:19,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:19,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:19,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:19,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-16 00:19:19,497 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:19:19,498 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-16 00:19:19,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:19,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:19,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:19,500 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:19:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 236 proven. 44 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2019-11-16 00:19:19,544 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:19,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-16 00:19:19,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558042502] [2019-11-16 00:19:19,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:19:19,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:19,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:19:19,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:19:19,546 INFO L87 Difference]: Start difference. First operand 1984 states and 3044 transitions. Second operand 8 states. [2019-11-16 00:19:20,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:20,279 INFO L93 Difference]: Finished difference Result 4104 states and 6260 transitions. [2019-11-16 00:19:20,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:19:20,281 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 224 [2019-11-16 00:19:20,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:20,283 INFO L225 Difference]: With dead ends: 4104 [2019-11-16 00:19:20,283 INFO L226 Difference]: Without dead ends: 2130 [2019-11-16 00:19:20,286 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:19:20,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2019-11-16 00:19:20,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 1984. [2019-11-16 00:19:20,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1984 states. [2019-11-16 00:19:20,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 3014 transitions. [2019-11-16 00:19:20,349 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 3014 transitions. Word has length 224 [2019-11-16 00:19:20,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:20,349 INFO L462 AbstractCegarLoop]: Abstraction has 1984 states and 3014 transitions. [2019-11-16 00:19:20,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:19:20,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 3014 transitions. [2019-11-16 00:19:20,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-16 00:19:20,354 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:20,354 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:20,556 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:20,556 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:20,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:20,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1159079950, now seen corresponding path program 1 times [2019-11-16 00:19:20,556 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:20,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419249984] [2019-11-16 00:19:20,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:20,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:20,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:20,719 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 241 proven. 40 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-11-16 00:19:20,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419249984] [2019-11-16 00:19:20,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893582892] [2019-11-16 00:19:20,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:20,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:19:20,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:20,913 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-16 00:19:20,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:20,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:20,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:20,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-16 00:19:20,941 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:19:20,942 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:19:20,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:20,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:20,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:20,946 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-16 00:19:20,959 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:19:20,959 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-16 00:19:20,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:20,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:20,961 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:20,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:19:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 241 proven. 40 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-11-16 00:19:20,994 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:20,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-16 00:19:20,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692463071] [2019-11-16 00:19:20,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:19:20,994 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:20,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:19:20,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:19:20,995 INFO L87 Difference]: Start difference. First operand 1984 states and 3014 transitions. Second operand 8 states. [2019-11-16 00:19:21,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:21,745 INFO L93 Difference]: Finished difference Result 4159 states and 6267 transitions. [2019-11-16 00:19:21,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:19:21,748 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 224 [2019-11-16 00:19:21,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:21,750 INFO L225 Difference]: With dead ends: 4159 [2019-11-16 00:19:21,751 INFO L226 Difference]: Without dead ends: 2185 [2019-11-16 00:19:21,755 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:19:21,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2019-11-16 00:19:21,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 1984. [2019-11-16 00:19:21,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1984 states. [2019-11-16 00:19:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 2984 transitions. [2019-11-16 00:19:21,821 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 2984 transitions. Word has length 224 [2019-11-16 00:19:21,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:21,821 INFO L462 AbstractCegarLoop]: Abstraction has 1984 states and 2984 transitions. [2019-11-16 00:19:21,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:19:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 2984 transitions. [2019-11-16 00:19:21,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-16 00:19:21,824 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:21,824 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 9, 9, 9, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:22,037 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:22,037 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:22,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:22,037 INFO L82 PathProgramCache]: Analyzing trace with hash -433226562, now seen corresponding path program 1 times [2019-11-16 00:19:22,038 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:22,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542137153] [2019-11-16 00:19:22,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:22,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:22,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:22,138 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 249 proven. 36 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2019-11-16 00:19:22,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542137153] [2019-11-16 00:19:22,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616482389] [2019-11-16 00:19:22,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:22,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:19:22,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:22,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-16 00:19:22,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:22,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:22,325 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:22,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-16 00:19:22,339 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:19:22,339 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:19:22,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:22,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:22,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:22,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-16 00:19:22,355 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:19:22,356 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-16 00:19:22,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:22,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:22,357 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:22,357 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:19:22,396 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 249 proven. 36 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2019-11-16 00:19:22,396 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:22,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-16 00:19:22,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487430975] [2019-11-16 00:19:22,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:19:22,397 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:22,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:19:22,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:19:22,398 INFO L87 Difference]: Start difference. First operand 1984 states and 2984 transitions. Second operand 8 states. [2019-11-16 00:19:23,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:23,159 INFO L93 Difference]: Finished difference Result 4159 states and 6207 transitions. [2019-11-16 00:19:23,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:19:23,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 226 [2019-11-16 00:19:23,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:23,161 INFO L225 Difference]: With dead ends: 4159 [2019-11-16 00:19:23,161 INFO L226 Difference]: Without dead ends: 2185 [2019-11-16 00:19:23,162 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:19:23,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2019-11-16 00:19:23,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 1984. [2019-11-16 00:19:23,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1984 states. [2019-11-16 00:19:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 2954 transitions. [2019-11-16 00:19:23,208 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 2954 transitions. Word has length 226 [2019-11-16 00:19:23,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:23,209 INFO L462 AbstractCegarLoop]: Abstraction has 1984 states and 2954 transitions. [2019-11-16 00:19:23,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:19:23,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 2954 transitions. [2019-11-16 00:19:23,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-16 00:19:23,211 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:23,212 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:23,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:23,415 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:23,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:23,415 INFO L82 PathProgramCache]: Analyzing trace with hash -33187724, now seen corresponding path program 1 times [2019-11-16 00:19:23,415 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:23,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829959535] [2019-11-16 00:19:23,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:23,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:23,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:23,521 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 153 proven. 18 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2019-11-16 00:19:23,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829959535] [2019-11-16 00:19:23,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48312926] [2019-11-16 00:19:23,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:23,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:19:23,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:23,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-16 00:19:23,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:23,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:23,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:23,747 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-16 00:19:23,775 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:19:23,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:19:23,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:23,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:23,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:23,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-16 00:19:23,806 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:19:23,807 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 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-16 00:19:23,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:23,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:23,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:23,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:19:23,863 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 267 proven. 24 refuted. 0 times theorem prover too weak. 473 trivial. 0 not checked. [2019-11-16 00:19:23,863 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:23,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-16 00:19:23,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363008996] [2019-11-16 00:19:23,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:19:23,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:23,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:19:23,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:19:23,865 INFO L87 Difference]: Start difference. First operand 1984 states and 2954 transitions. Second operand 12 states. [2019-11-16 00:19:25,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:25,330 INFO L93 Difference]: Finished difference Result 4837 states and 7112 transitions. [2019-11-16 00:19:25,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-16 00:19:25,330 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 226 [2019-11-16 00:19:25,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:25,332 INFO L225 Difference]: With dead ends: 4837 [2019-11-16 00:19:25,333 INFO L226 Difference]: Without dead ends: 2863 [2019-11-16 00:19:25,334 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2019-11-16 00:19:25,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2019-11-16 00:19:25,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 2020. [2019-11-16 00:19:25,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2020 states. [2019-11-16 00:19:25,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 2935 transitions. [2019-11-16 00:19:25,399 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 2935 transitions. Word has length 226 [2019-11-16 00:19:25,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:25,399 INFO L462 AbstractCegarLoop]: Abstraction has 2020 states and 2935 transitions. [2019-11-16 00:19:25,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:19:25,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2935 transitions. [2019-11-16 00:19:25,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-16 00:19:25,401 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:25,401 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:25,602 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:25,602 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:25,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:25,602 INFO L82 PathProgramCache]: Analyzing trace with hash -172920627, now seen corresponding path program 1 times [2019-11-16 00:19:25,603 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:25,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860597418] [2019-11-16 00:19:25,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:25,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:25,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:25,732 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 254 proven. 35 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2019-11-16 00:19:25,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860597418] [2019-11-16 00:19:25,733 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741378867] [2019-11-16 00:19:25,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:25,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:19:25,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:25,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-16 00:19:25,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:26,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:26,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:26,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-16 00:19:26,037 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:19:26,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:19:26,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:26,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:26,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:26,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-16 00:19:26,073 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:19:26,073 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-16 00:19:26,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:26,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:26,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:26,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:19:26,125 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 254 proven. 35 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2019-11-16 00:19:26,125 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:26,125 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-16 00:19:26,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413782326] [2019-11-16 00:19:26,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:19:26,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:26,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:19:26,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:19:26,127 INFO L87 Difference]: Start difference. First operand 2020 states and 2935 transitions. Second operand 8 states. [2019-11-16 00:19:27,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:27,132 INFO L93 Difference]: Finished difference Result 4231 states and 6109 transitions. [2019-11-16 00:19:27,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:19:27,133 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 229 [2019-11-16 00:19:27,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:27,134 INFO L225 Difference]: With dead ends: 4231 [2019-11-16 00:19:27,134 INFO L226 Difference]: Without dead ends: 2221 [2019-11-16 00:19:27,135 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:19:27,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2019-11-16 00:19:27,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 2020. [2019-11-16 00:19:27,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2020 states. [2019-11-16 00:19:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 2900 transitions. [2019-11-16 00:19:27,181 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 2900 transitions. Word has length 229 [2019-11-16 00:19:27,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:27,181 INFO L462 AbstractCegarLoop]: Abstraction has 2020 states and 2900 transitions. [2019-11-16 00:19:27,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:19:27,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2900 transitions. [2019-11-16 00:19:27,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-16 00:19:27,182 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:27,183 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:27,383 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:27,383 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:27,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:27,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1507522547, now seen corresponding path program 1 times [2019-11-16 00:19:27,383 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:27,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473048298] [2019-11-16 00:19:27,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:27,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:27,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:27,473 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2019-11-16 00:19:27,473 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473048298] [2019-11-16 00:19:27,474 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:27,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:19:27,474 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962496191] [2019-11-16 00:19:27,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:27,474 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:27,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:27,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:27,475 INFO L87 Difference]: Start difference. First operand 2020 states and 2900 transitions. Second operand 4 states. [2019-11-16 00:19:27,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:27,729 INFO L93 Difference]: Finished difference Result 3784 states and 5425 transitions. [2019-11-16 00:19:27,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:19:27,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-11-16 00:19:27,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:27,732 INFO L225 Difference]: With dead ends: 3784 [2019-11-16 00:19:27,732 INFO L226 Difference]: Without dead ends: 2102 [2019-11-16 00:19:27,733 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:19:27,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2019-11-16 00:19:27,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 2020. [2019-11-16 00:19:27,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2020 states. [2019-11-16 00:19:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 2895 transitions. [2019-11-16 00:19:27,787 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 2895 transitions. Word has length 229 [2019-11-16 00:19:27,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:27,787 INFO L462 AbstractCegarLoop]: Abstraction has 2020 states and 2895 transitions. [2019-11-16 00:19:27,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:27,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2895 transitions. [2019-11-16 00:19:27,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-16 00:19:27,789 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:27,789 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:27,789 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:27,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:27,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1442481688, now seen corresponding path program 1 times [2019-11-16 00:19:27,790 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:27,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76659431] [2019-11-16 00:19:27,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:27,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:27,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:27,958 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 417 proven. 1 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-11-16 00:19:27,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76659431] [2019-11-16 00:19:27,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064917277] [2019-11-16 00:19:27,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:28,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:19:28,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:28,172 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-16 00:19:28,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:28,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:28,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:28,181 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:19:28,209 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:19:28,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:19:28,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:28,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:28,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:28,215 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:19:28,232 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:19:28,232 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-16 00:19:28,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:28,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:28,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:28,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:19:28,280 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 396 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-11-16 00:19:28,280 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:19:28,281 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-16 00:19:28,281 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501349913] [2019-11-16 00:19:28,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:19:28,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:28,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:19:28,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:19:28,283 INFO L87 Difference]: Start difference. First operand 2020 states and 2895 transitions. Second operand 5 states. [2019-11-16 00:19:28,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:28,657 INFO L93 Difference]: Finished difference Result 4034 states and 5780 transitions. [2019-11-16 00:19:28,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:19:28,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 230 [2019-11-16 00:19:28,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:28,659 INFO L225 Difference]: With dead ends: 4034 [2019-11-16 00:19:28,659 INFO L226 Difference]: Without dead ends: 2350 [2019-11-16 00:19:28,660 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 229 SyntacticMatches, 7 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:19:28,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2019-11-16 00:19:28,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 2020. [2019-11-16 00:19:28,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2020 states. [2019-11-16 00:19:28,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 2889 transitions. [2019-11-16 00:19:28,707 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 2889 transitions. Word has length 230 [2019-11-16 00:19:28,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:28,707 INFO L462 AbstractCegarLoop]: Abstraction has 2020 states and 2889 transitions. [2019-11-16 00:19:28,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:19:28,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2889 transitions. [2019-11-16 00:19:28,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-16 00:19:28,708 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:28,708 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:28,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:28,909 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:28,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:28,909 INFO L82 PathProgramCache]: Analyzing trace with hash -91096470, now seen corresponding path program 1 times [2019-11-16 00:19:28,909 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:28,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569152386] [2019-11-16 00:19:28,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:28,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:28,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:29,082 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 417 proven. 1 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-11-16 00:19:29,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569152386] [2019-11-16 00:19:29,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204417155] [2019-11-16 00:19:29,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:29,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:19:29,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:29,327 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-16 00:19:29,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:29,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:29,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:29,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:19:29,345 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:19:29,345 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:19:29,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:29,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:29,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:29,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:19:29,368 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:19:29,368 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-16 00:19:29,368 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:29,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:29,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:29,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:19:29,404 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 396 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-11-16 00:19:29,404 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:19:29,405 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-16 00:19:29,405 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454079321] [2019-11-16 00:19:29,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:19:29,405 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:29,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:19:29,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:19:29,406 INFO L87 Difference]: Start difference. First operand 2020 states and 2889 transitions. Second operand 5 states. [2019-11-16 00:19:29,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:29,918 INFO L93 Difference]: Finished difference Result 4034 states and 5775 transitions. [2019-11-16 00:19:29,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:19:29,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 230 [2019-11-16 00:19:29,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:29,920 INFO L225 Difference]: With dead ends: 4034 [2019-11-16 00:19:29,920 INFO L226 Difference]: Without dead ends: 2350 [2019-11-16 00:19:29,921 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 229 SyntacticMatches, 7 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:19:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2019-11-16 00:19:29,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 2020. [2019-11-16 00:19:29,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2020 states. [2019-11-16 00:19:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 2883 transitions. [2019-11-16 00:19:29,977 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 2883 transitions. Word has length 230 [2019-11-16 00:19:29,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:29,978 INFO L462 AbstractCegarLoop]: Abstraction has 2020 states and 2883 transitions. [2019-11-16 00:19:29,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:19:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2883 transitions. [2019-11-16 00:19:29,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-16 00:19:29,979 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:29,979 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 7, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:30,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:30,180 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:30,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:30,180 INFO L82 PathProgramCache]: Analyzing trace with hash -594421422, now seen corresponding path program 1 times [2019-11-16 00:19:30,180 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:30,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679809158] [2019-11-16 00:19:30,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:30,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:30,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:30,277 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2019-11-16 00:19:30,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679809158] [2019-11-16 00:19:30,277 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:30,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:19:30,278 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976035810] [2019-11-16 00:19:30,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:30,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:30,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:30,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:30,279 INFO L87 Difference]: Start difference. First operand 2020 states and 2883 transitions. Second operand 4 states. [2019-11-16 00:19:30,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:30,617 INFO L93 Difference]: Finished difference Result 4190 states and 5977 transitions. [2019-11-16 00:19:30,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:19:30,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-11-16 00:19:30,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:30,619 INFO L225 Difference]: With dead ends: 4190 [2019-11-16 00:19:30,619 INFO L226 Difference]: Without dead ends: 2180 [2019-11-16 00:19:30,620 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:19:30,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2019-11-16 00:19:30,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2025. [2019-11-16 00:19:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2025 states. [2019-11-16 00:19:30,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 2888 transitions. [2019-11-16 00:19:30,665 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 2888 transitions. Word has length 232 [2019-11-16 00:19:30,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:30,665 INFO L462 AbstractCegarLoop]: Abstraction has 2025 states and 2888 transitions. [2019-11-16 00:19:30,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:30,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 2888 transitions. [2019-11-16 00:19:30,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-16 00:19:30,668 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:30,668 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 9, 8, 8, 7, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:30,669 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:30,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:30,669 INFO L82 PathProgramCache]: Analyzing trace with hash 822278286, now seen corresponding path program 1 times [2019-11-16 00:19:30,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:30,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299222989] [2019-11-16 00:19:30,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:30,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:30,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:30,756 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 267 proven. 29 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-16 00:19:30,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299222989] [2019-11-16 00:19:30,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471959586] [2019-11-16 00:19:30,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:30,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:19:30,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:30,945 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-16 00:19:30,946 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:30,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:30,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:30,948 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-16 00:19:30,962 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:19:30,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:19:30,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:30,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:30,971 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:30,971 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-16 00:19:30,990 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:19:30,990 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-16 00:19:30,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:30,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:30,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:30,995 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:19:31,041 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 267 proven. 29 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-16 00:19:31,042 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:31,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-16 00:19:31,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245692801] [2019-11-16 00:19:31,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:19:31,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:31,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:19:31,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:19:31,043 INFO L87 Difference]: Start difference. First operand 2025 states and 2888 transitions. Second operand 8 states. [2019-11-16 00:19:31,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:31,668 INFO L93 Difference]: Finished difference Result 3902 states and 5544 transitions. [2019-11-16 00:19:31,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:19:31,669 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 232 [2019-11-16 00:19:31,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:31,670 INFO L225 Difference]: With dead ends: 3902 [2019-11-16 00:19:31,670 INFO L226 Difference]: Without dead ends: 1887 [2019-11-16 00:19:31,671 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:19:31,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2019-11-16 00:19:31,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1761. [2019-11-16 00:19:31,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1761 states. [2019-11-16 00:19:31,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2477 transitions. [2019-11-16 00:19:31,713 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2477 transitions. Word has length 232 [2019-11-16 00:19:31,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:31,713 INFO L462 AbstractCegarLoop]: Abstraction has 1761 states and 2477 transitions. [2019-11-16 00:19:31,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:19:31,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2477 transitions. [2019-11-16 00:19:31,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-11-16 00:19:31,716 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:31,716 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 7, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:31,917 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:31,917 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:31,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:31,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1920582938, now seen corresponding path program 1 times [2019-11-16 00:19:31,918 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:31,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754380493] [2019-11-16 00:19:31,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:31,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:31,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 359 proven. 11 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-11-16 00:19:31,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754380493] [2019-11-16 00:19:31,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844828152] [2019-11-16 00:19:31,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:32,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:19:32,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:32,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-16 00:19:32,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:32,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:32,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:32,210 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-16 00:19:32,228 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:19:32,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:19:32,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:32,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:32,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:32,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-16 00:19:32,251 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:19:32,251 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-16 00:19:32,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:32,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:32,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:32,254 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:19:32,302 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 359 proven. 11 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-11-16 00:19:32,302 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:32,303 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-16 00:19:32,303 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112160239] [2019-11-16 00:19:32,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:19:32,303 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:32,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:19:32,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:19:32,304 INFO L87 Difference]: Start difference. First operand 1761 states and 2477 transitions. Second operand 8 states. [2019-11-16 00:19:33,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:33,029 INFO L93 Difference]: Finished difference Result 3648 states and 5116 transitions. [2019-11-16 00:19:33,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:19:33,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 234 [2019-11-16 00:19:33,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:33,031 INFO L225 Difference]: With dead ends: 3648 [2019-11-16 00:19:33,031 INFO L226 Difference]: Without dead ends: 1897 [2019-11-16 00:19:33,032 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:19:33,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2019-11-16 00:19:33,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1761. [2019-11-16 00:19:33,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1761 states. [2019-11-16 00:19:33,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2457 transitions. [2019-11-16 00:19:33,085 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2457 transitions. Word has length 234 [2019-11-16 00:19:33,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:33,085 INFO L462 AbstractCegarLoop]: Abstraction has 1761 states and 2457 transitions. [2019-11-16 00:19:33,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:19:33,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2457 transitions. [2019-11-16 00:19:33,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-11-16 00:19:33,086 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:33,087 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 7, 7, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:33,287 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:33,287 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:33,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:33,287 INFO L82 PathProgramCache]: Analyzing trace with hash 90247712, now seen corresponding path program 1 times [2019-11-16 00:19:33,288 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:33,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396423765] [2019-11-16 00:19:33,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:33,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:33,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:33,409 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 456 proven. 17 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2019-11-16 00:19:33,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396423765] [2019-11-16 00:19:33,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044548957] [2019-11-16 00:19:33,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:33,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 901 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:19:33,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:33,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-16 00:19:33,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:33,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:33,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:33,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-16 00:19:33,663 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:19:33,664 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:19:33,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:33,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:33,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:33,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-16 00:19:33,683 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:19:33,683 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-16 00:19:33,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:33,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:33,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:33,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:19:33,724 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 456 proven. 17 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2019-11-16 00:19:33,725 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:19:33,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-16 00:19:33,725 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240212754] [2019-11-16 00:19:33,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:19:33,725 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:33,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:19:33,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:19:33,726 INFO L87 Difference]: Start difference. First operand 1761 states and 2457 transitions. Second operand 8 states. [2019-11-16 00:19:34,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:34,418 INFO L93 Difference]: Finished difference Result 3274 states and 4561 transitions. [2019-11-16 00:19:34,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:19:34,418 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 249 [2019-11-16 00:19:34,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:34,419 INFO L225 Difference]: With dead ends: 3274 [2019-11-16 00:19:34,419 INFO L226 Difference]: Without dead ends: 1850 [2019-11-16 00:19:34,420 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:19:34,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2019-11-16 00:19:34,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1764. [2019-11-16 00:19:34,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1764 states. [2019-11-16 00:19:34,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 2450 transitions. [2019-11-16 00:19:34,470 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 2450 transitions. Word has length 249 [2019-11-16 00:19:34,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:34,470 INFO L462 AbstractCegarLoop]: Abstraction has 1764 states and 2450 transitions. [2019-11-16 00:19:34,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:19:34,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2450 transitions. [2019-11-16 00:19:34,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-11-16 00:19:34,472 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:34,472 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:34,672 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:34,672 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:34,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:34,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1269705896, now seen corresponding path program 1 times [2019-11-16 00:19:34,673 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:34,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093647970] [2019-11-16 00:19:34,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:34,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:34,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-11-16 00:19:34,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093647970] [2019-11-16 00:19:34,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:34,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:19:34,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533922127] [2019-11-16 00:19:34,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:34,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:34,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:34,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:34,773 INFO L87 Difference]: Start difference. First operand 1764 states and 2450 transitions. Second operand 4 states. [2019-11-16 00:19:35,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:35,029 INFO L93 Difference]: Finished difference Result 3598 states and 4998 transitions. [2019-11-16 00:19:35,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:19:35,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 251 [2019-11-16 00:19:35,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:35,031 INFO L225 Difference]: With dead ends: 3598 [2019-11-16 00:19:35,031 INFO L226 Difference]: Without dead ends: 1844 [2019-11-16 00:19:35,032 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:19:35,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2019-11-16 00:19:35,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1779. [2019-11-16 00:19:35,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2019-11-16 00:19:35,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2475 transitions. [2019-11-16 00:19:35,074 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2475 transitions. Word has length 251 [2019-11-16 00:19:35,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:35,074 INFO L462 AbstractCegarLoop]: Abstraction has 1779 states and 2475 transitions. [2019-11-16 00:19:35,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:35,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2475 transitions. [2019-11-16 00:19:35,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-11-16 00:19:35,076 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:35,076 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:35,077 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:35,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:35,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1602349034, now seen corresponding path program 1 times [2019-11-16 00:19:35,077 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:35,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907559539] [2019-11-16 00:19:35,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:35,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:35,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:35,208 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-11-16 00:19:35,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907559539] [2019-11-16 00:19:35,208 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:35,208 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:19:35,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697852477] [2019-11-16 00:19:35,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:35,209 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:35,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:35,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:35,210 INFO L87 Difference]: Start difference. First operand 1779 states and 2475 transitions. Second operand 4 states. [2019-11-16 00:19:35,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:35,510 INFO L93 Difference]: Finished difference Result 3663 states and 5108 transitions. [2019-11-16 00:19:35,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:19:35,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 251 [2019-11-16 00:19:35,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:35,512 INFO L225 Difference]: With dead ends: 3663 [2019-11-16 00:19:35,512 INFO L226 Difference]: Without dead ends: 1894 [2019-11-16 00:19:35,513 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:19:35,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2019-11-16 00:19:35,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1814. [2019-11-16 00:19:35,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1814 states. [2019-11-16 00:19:35,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 2540 transitions. [2019-11-16 00:19:35,555 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 2540 transitions. Word has length 251 [2019-11-16 00:19:35,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:35,555 INFO L462 AbstractCegarLoop]: Abstraction has 1814 states and 2540 transitions. [2019-11-16 00:19:35,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:35,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2540 transitions. [2019-11-16 00:19:35,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-11-16 00:19:35,557 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:35,557 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:35,557 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:35,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:35,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1143517931, now seen corresponding path program 1 times [2019-11-16 00:19:35,558 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:35,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148840978] [2019-11-16 00:19:35,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:35,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:35,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2019-11-16 00:19:35,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148840978] [2019-11-16 00:19:35,672 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:35,673 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:19:35,673 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129916104] [2019-11-16 00:19:35,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:35,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:35,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:35,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:35,674 INFO L87 Difference]: Start difference. First operand 1814 states and 2540 transitions. Second operand 4 states. [2019-11-16 00:19:35,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:35,996 INFO L93 Difference]: Finished difference Result 3900 states and 5460 transitions. [2019-11-16 00:19:35,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:19:35,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 282 [2019-11-16 00:19:35,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:35,998 INFO L225 Difference]: With dead ends: 3900 [2019-11-16 00:19:35,998 INFO L226 Difference]: Without dead ends: 2096 [2019-11-16 00:19:35,999 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:19:36,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2096 states. [2019-11-16 00:19:36,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2096 to 1989. [2019-11-16 00:19:36,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-11-16 00:19:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2800 transitions. [2019-11-16 00:19:36,041 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2800 transitions. Word has length 282 [2019-11-16 00:19:36,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:36,041 INFO L462 AbstractCegarLoop]: Abstraction has 1989 states and 2800 transitions. [2019-11-16 00:19:36,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:36,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2800 transitions. [2019-11-16 00:19:36,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-11-16 00:19:36,043 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:36,043 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:36,043 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:36,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:36,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1476161069, now seen corresponding path program 1 times [2019-11-16 00:19:36,044 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:36,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93295673] [2019-11-16 00:19:36,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:36,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:36,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 557 trivial. 0 not checked. [2019-11-16 00:19:36,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93295673] [2019-11-16 00:19:36,152 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:36,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:19:36,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601330042] [2019-11-16 00:19:36,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:36,153 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:36,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:36,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:36,153 INFO L87 Difference]: Start difference. First operand 1989 states and 2800 transitions. Second operand 4 states. [2019-11-16 00:19:36,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:36,456 INFO L93 Difference]: Finished difference Result 4088 states and 5755 transitions. [2019-11-16 00:19:36,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:19:36,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 282 [2019-11-16 00:19:36,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:36,458 INFO L225 Difference]: With dead ends: 4088 [2019-11-16 00:19:36,458 INFO L226 Difference]: Without dead ends: 2109 [2019-11-16 00:19:36,459 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:19:36,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2019-11-16 00:19:36,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 1994. [2019-11-16 00:19:36,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1994 states. [2019-11-16 00:19:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 2805 transitions. [2019-11-16 00:19:36,501 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 2805 transitions. Word has length 282 [2019-11-16 00:19:36,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:36,501 INFO L462 AbstractCegarLoop]: Abstraction has 1994 states and 2805 transitions. [2019-11-16 00:19:36,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:36,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2805 transitions. [2019-11-16 00:19:36,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-11-16 00:19:36,503 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:36,503 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:36,503 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:36,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:36,503 INFO L82 PathProgramCache]: Analyzing trace with hash -589713632, now seen corresponding path program 1 times [2019-11-16 00:19:36,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:36,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498779777] [2019-11-16 00:19:36,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:36,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:36,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:36,644 INFO L134 CoverageAnalysis]: Checked inductivity of 897 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 557 trivial. 0 not checked. [2019-11-16 00:19:36,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498779777] [2019-11-16 00:19:36,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:36,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:19:36,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291477271] [2019-11-16 00:19:36,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:36,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:36,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:36,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:36,646 INFO L87 Difference]: Start difference. First operand 1994 states and 2805 transitions. Second operand 4 states. [2019-11-16 00:19:36,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:36,972 INFO L93 Difference]: Finished difference Result 4093 states and 5755 transitions. [2019-11-16 00:19:36,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:19:36,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 282 [2019-11-16 00:19:36,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:36,974 INFO L225 Difference]: With dead ends: 4093 [2019-11-16 00:19:36,974 INFO L226 Difference]: Without dead ends: 2109 [2019-11-16 00:19:36,975 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:19:36,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2019-11-16 00:19:37,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 1999. [2019-11-16 00:19:37,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1999 states. [2019-11-16 00:19:37,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 2810 transitions. [2019-11-16 00:19:37,018 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 2810 transitions. Word has length 282 [2019-11-16 00:19:37,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:37,018 INFO L462 AbstractCegarLoop]: Abstraction has 1999 states and 2810 transitions. [2019-11-16 00:19:37,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:37,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2810 transitions. [2019-11-16 00:19:37,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-11-16 00:19:37,020 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:37,020 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:37,020 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:37,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:37,021 INFO L82 PathProgramCache]: Analyzing trace with hash -104410127, now seen corresponding path program 1 times [2019-11-16 00:19:37,021 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:37,021 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602822153] [2019-11-16 00:19:37,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:37,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:37,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:37,145 INFO L134 CoverageAnalysis]: Checked inductivity of 897 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 557 trivial. 0 not checked. [2019-11-16 00:19:37,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602822153] [2019-11-16 00:19:37,146 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:37,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:19:37,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787191284] [2019-11-16 00:19:37,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:37,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:37,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:37,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:37,146 INFO L87 Difference]: Start difference. First operand 1999 states and 2810 transitions. Second operand 4 states. [2019-11-16 00:19:37,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:37,436 INFO L93 Difference]: Finished difference Result 4088 states and 5745 transitions. [2019-11-16 00:19:37,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:19:37,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 283 [2019-11-16 00:19:37,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:37,438 INFO L225 Difference]: With dead ends: 4088 [2019-11-16 00:19:37,438 INFO L226 Difference]: Without dead ends: 2099 [2019-11-16 00:19:37,439 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:19:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2019-11-16 00:19:37,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 2004. [2019-11-16 00:19:37,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2004 states. [2019-11-16 00:19:37,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 2815 transitions. [2019-11-16 00:19:37,483 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 2815 transitions. Word has length 283 [2019-11-16 00:19:37,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:37,483 INFO L462 AbstractCegarLoop]: Abstraction has 2004 states and 2815 transitions. [2019-11-16 00:19:37,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:37,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 2815 transitions. [2019-11-16 00:19:37,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-11-16 00:19:37,485 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:37,485 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:37,485 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:37,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:37,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1588495653, now seen corresponding path program 1 times [2019-11-16 00:19:37,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:37,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100082032] [2019-11-16 00:19:37,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:37,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:37,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:37,617 INFO L134 CoverageAnalysis]: Checked inductivity of 897 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 557 trivial. 0 not checked. [2019-11-16 00:19:37,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100082032] [2019-11-16 00:19:37,617 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:37,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:19:37,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390623796] [2019-11-16 00:19:37,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:37,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:19:37,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:37,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:37,618 INFO L87 Difference]: Start difference. First operand 2004 states and 2815 transitions. Second operand 4 states. [2019-11-16 00:19:37,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:37,898 INFO L93 Difference]: Finished difference Result 4068 states and 5710 transitions. [2019-11-16 00:19:37,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:19:37,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 284 [2019-11-16 00:19:37,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:37,899 INFO L225 Difference]: With dead ends: 4068 [2019-11-16 00:19:37,900 INFO L226 Difference]: Without dead ends: 2074 [2019-11-16 00:19:37,901 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:19:37,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2019-11-16 00:19:37,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2009. [2019-11-16 00:19:37,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2009 states. [2019-11-16 00:19:37,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 2820 transitions. [2019-11-16 00:19:37,944 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 2820 transitions. Word has length 284 [2019-11-16 00:19:37,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:37,944 INFO L462 AbstractCegarLoop]: Abstraction has 2009 states and 2820 transitions. [2019-11-16 00:19:37,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:37,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 2820 transitions. [2019-11-16 00:19:37,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-11-16 00:19:37,946 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:37,946 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:37,946 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:37,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:37,947 INFO L82 PathProgramCache]: Analyzing trace with hash -955305556, now seen corresponding path program 1 times [2019-11-16 00:19:37,947 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:19:37,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563254962] [2019-11-16 00:19:37,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:37,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:19:37,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:19:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:38,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1032 backedges. 432 proven. 252 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-11-16 00:19:38,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563254962] [2019-11-16 00:19:38,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39473555] [2019-11-16 00:19:38,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:39,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 84 conjunts are in the unsatisfiable core [2019-11-16 00:19:39,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:39,333 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:39,334 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-11-16 00:19:39,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:39,566 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-16 00:19:39,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:39,569 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|, |v_#memory_$Pointer$.base_160|], 2=[|v_#memory_$Pointer$.offset_146|, |v_#memory_$Pointer$.offset_147|, |v_#memory_$Pointer$.base_148|, |v_#memory_$Pointer$.base_147|, |v_#memory_$Pointer$.base_146|, |v_#memory_$Pointer$.offset_148|]} [2019-11-16 00:19:39,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:39,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:39,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:39,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:39,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:39,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:39,646 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-16 00:19:39,646 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:39,810 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-16 00:19:39,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:39,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:39,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:39,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:39,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:39,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:39,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:39,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-16 00:19:39,875 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:39,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:39,967 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:19:40,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:40,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2019-11-16 00:19:40,068 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:40,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:40,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2019-11-16 00:19:40,148 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:40,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:40,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-16 00:19:40,215 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:40,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:40,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-16 00:19:40,270 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:40,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:40,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,317 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-11-16 00:19:40,317 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:40,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:40,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:40,343 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 15 variables, input treesize:214, output treesize:91 [2019-11-16 00:19:40,367 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_160|], 12=[|v_#memory_$Pointer$.base_161|]} [2019-11-16 00:19:40,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:19:40,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:40,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:40,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 52 [2019-11-16 00:19:40,396 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:40,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:40,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:40,409 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-11-16 00:19:40,414 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_161|, |v_#memory_$Pointer$.offset_149|, |v_#memory_$Pointer$.base_150|], 6=[|v_#memory_$Pointer$.base_149|, |v_#memory_$Pointer$.offset_150|], 12=[|v_#memory_$Pointer$.base_162|]} [2019-11-16 00:19:40,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:19:40,424 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:40,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:40,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:19:40,488 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:40,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:40,537 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:19:40,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:40,573 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:19:40,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:40,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:40,638 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:40,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 198 treesize of output 337 [2019-11-16 00:19:40,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:19:40,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:19:40,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:19:40,643 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-11-16 00:19:40,718 INFO L567 ElimStorePlain]: treesize reduction 445, result has 31.1 percent of original size [2019-11-16 00:19:40,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:40,921 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.downgradeDimensionsIfNecessary(ArrayOccurrenceAnalysis.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:200) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-11-16 00:19:40,924 INFO L168 Benchmark]: Toolchain (without parser) took 69139.37 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 938.0 MB in the beginning and 906.7 MB in the end (delta: 31.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-16 00:19:40,924 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:19:40,925 INFO L168 Benchmark]: CACSL2BoogieTranslator took 895.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -163.7 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:40,925 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:19:40,925 INFO L168 Benchmark]: Boogie Preprocessor took 67.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:40,925 INFO L168 Benchmark]: RCFGBuilder took 1143.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.0 MB in the end (delta: 96.0 MB). Peak memory consumption was 96.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:40,926 INFO L168 Benchmark]: TraceAbstraction took 66903.42 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 999.0 MB in the beginning and 906.7 MB in the end (delta: 92.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-16 00:19:40,927 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 895.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -163.7 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 124.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1143.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.0 MB in the end (delta: 96.0 MB). Peak memory consumption was 96.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 66903.42 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 999.0 MB in the beginning and 906.7 MB in the end (delta: 92.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.NullPointerException de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.NullPointerException: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-16 00:19:43,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:19:43,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:19:43,146 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:19:43,146 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:19:43,147 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:19:43,149 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:19:43,151 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:19:43,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:19:43,153 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:19:43,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:19:43,155 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:19:43,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:19:43,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:19:43,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:19:43,159 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:19:43,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:19:43,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:19:43,162 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:19:43,164 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:19:43,166 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:19:43,167 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:19:43,168 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:19:43,169 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:19:43,172 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:19:43,172 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:19:43,173 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:19:43,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:19:43,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:19:43,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:19:43,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:19:43,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:19:43,177 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:19:43,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:19:43,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:19:43,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:19:43,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:19:43,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:19:43,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:19:43,181 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:19:43,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:19:43,182 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-16 00:19:43,196 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:19:43,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:19:43,198 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:19:43,198 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:19:43,198 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:19:43,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:19:43,199 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:19:43,199 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:19:43,199 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:19:43,199 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:19:43,200 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:19:43,200 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:19:43,200 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:19:43,200 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:19:43,200 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:19:43,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:19:43,201 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:19:43,201 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:19:43,201 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:19:43,202 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:19:43,202 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:19:43,202 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:19:43,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:19:43,203 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:19:43,203 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:19:43,203 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:19:43,203 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:19:43,203 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:19:43,204 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:19:43,204 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:19:43,204 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_03acfa36-789b-4934-8dd4-9773202ec553/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 -> a9e85c0038d1608b1041d2a9bd9534081fc54745 [2019-11-16 00:19:43,232 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:19:43,242 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:19:43,245 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:19:43,246 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:19:43,247 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:19:43,248 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-2.c [2019-11-16 00:19:43,299 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/data/3d7aa113b/f20607a153b2487181b7b5d323ff6faa/FLAGd0fcfadd8 [2019-11-16 00:19:43,829 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:19:43,830 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-2.c [2019-11-16 00:19:43,853 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/data/3d7aa113b/f20607a153b2487181b7b5d323ff6faa/FLAGd0fcfadd8 [2019-11-16 00:19:44,316 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/data/3d7aa113b/f20607a153b2487181b7b5d323ff6faa [2019-11-16 00:19:44,319 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:19:44,320 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:19:44,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:19:44,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:19:44,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:19:44,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:19:44" (1/1) ... [2019-11-16 00:19:44,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac3f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:44, skipping insertion in model container [2019-11-16 00:19:44,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:19:44" (1/1) ... [2019-11-16 00:19:44,334 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:19:44,404 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:19:44,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:19:44,942 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:19:45,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:19:45,127 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:19:45,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:45 WrapperNode [2019-11-16 00:19:45,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:19:45,129 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:19:45,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:19:45,130 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:19:45,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:45" (1/1) ... [2019-11-16 00:19:45,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:45" (1/1) ... [2019-11-16 00:19:45,233 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:19:45,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:19:45,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:19:45,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:19:45,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:45" (1/1) ... [2019-11-16 00:19:45,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:45" (1/1) ... [2019-11-16 00:19:45,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:45" (1/1) ... [2019-11-16 00:19:45,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:45" (1/1) ... [2019-11-16 00:19:45,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:45" (1/1) ... [2019-11-16 00:19:45,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:45" (1/1) ... [2019-11-16 00:19:45,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:45" (1/1) ... [2019-11-16 00:19:45,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:19:45,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:19:45,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:19:45,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:19:45,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:19:45,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:19:45,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:19:45,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-16 00:19:45,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:19:45,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:19:45,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:19:45,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:19:45,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-16 00:19:45,677 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:19:49,383 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-16 00:19:49,384 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-16 00:19:49,385 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:19:49,385 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:19:49,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:19:49 BoogieIcfgContainer [2019-11-16 00:19:49,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:19:49,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:19:49,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:19:49,390 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:19:49,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:19:44" (1/3) ... [2019-11-16 00:19:49,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6ebca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:19:49, skipping insertion in model container [2019-11-16 00:19:49,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:45" (2/3) ... [2019-11-16 00:19:49,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6ebca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:19:49, skipping insertion in model container [2019-11-16 00:19:49,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:19:49" (3/3) ... [2019-11-16 00:19:49,393 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-2.c [2019-11-16 00:19:49,400 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:19:49,405 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:19:49,413 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:19:49,430 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:19:49,430 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:19:49,430 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:19:49,431 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:19:49,431 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:19:49,431 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:19:49,431 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:19:49,431 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:19:49,447 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-11-16 00:19:49,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-16 00:19:49,455 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:49,455 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:19:49,457 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:49,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:49,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-11-16 00:19:49,473 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:19:49,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1678108242] [2019-11-16 00:19:49,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:19:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:49,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:19:49,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:49,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:49,713 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:19:49,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:49,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1678108242] [2019-11-16 00:19:49,733 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:49,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:19:49,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166181250] [2019-11-16 00:19:49,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:49,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:19:49,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:49,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:49,755 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2019-11-16 00:19:49,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:49,950 INFO L93 Difference]: Finished difference Result 488 states and 825 transitions. [2019-11-16 00:19:49,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:19:49,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-16 00:19:49,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:49,971 INFO L225 Difference]: With dead ends: 488 [2019-11-16 00:19:49,972 INFO L226 Difference]: Without dead ends: 315 [2019-11-16 00:19:49,977 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:49,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-16 00:19:50,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-11-16 00:19:50,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-16 00:19:50,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 472 transitions. [2019-11-16 00:19:50,062 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 472 transitions. Word has length 24 [2019-11-16 00:19:50,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:50,063 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 472 transitions. [2019-11-16 00:19:50,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:50,063 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 472 transitions. [2019-11-16 00:19:50,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-16 00:19:50,067 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:50,067 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-16 00:19:50,268 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:19:50,268 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:50,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:50,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1013386387, now seen corresponding path program 1 times [2019-11-16 00:19:50,270 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:19:50,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1349410265] [2019-11-16 00:19:50,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:19:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:50,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:19:50,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:50,528 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:50,529 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:19:50,545 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:19:50,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1349410265] [2019-11-16 00:19:50,545 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:50,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-16 00:19:50,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562809852] [2019-11-16 00:19:50,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:19:50,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:19:50,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:19:50,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:50,549 INFO L87 Difference]: Start difference. First operand 315 states and 472 transitions. Second operand 3 states. [2019-11-16 00:19:52,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:52,027 INFO L93 Difference]: Finished difference Result 621 states and 935 transitions. [2019-11-16 00:19:52,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:19:52,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-16 00:19:52,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:52,032 INFO L225 Difference]: With dead ends: 621 [2019-11-16 00:19:52,032 INFO L226 Difference]: Without dead ends: 414 [2019-11-16 00:19:52,035 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:19:52,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-11-16 00:19:52,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2019-11-16 00:19:52,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-16 00:19:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 618 transitions. [2019-11-16 00:19:52,078 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 618 transitions. Word has length 58 [2019-11-16 00:19:52,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:52,079 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 618 transitions. [2019-11-16 00:19:52,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:19:52,082 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 618 transitions. [2019-11-16 00:19:52,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-16 00:19:52,093 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:52,094 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2019-11-16 00:19:52,295 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:19:52,296 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:52,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:52,296 INFO L82 PathProgramCache]: Analyzing trace with hash 734843988, now seen corresponding path program 1 times [2019-11-16 00:19:52,297 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:19:52,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1207617205] [2019-11-16 00:19:52,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:19:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:52,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:19:52,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:19:52,527 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:19:52,548 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:19:52,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1207617205] [2019-11-16 00:19:52,556 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:19:52,557 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:19:52,557 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338488196] [2019-11-16 00:19:52,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:52,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:19:52,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:52,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:52,560 INFO L87 Difference]: Start difference. First operand 414 states and 618 transitions. Second operand 4 states. [2019-11-16 00:19:53,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:53,872 INFO L93 Difference]: Finished difference Result 922 states and 1384 transitions. [2019-11-16 00:19:53,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:19:53,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-16 00:19:53,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:53,877 INFO L225 Difference]: With dead ends: 922 [2019-11-16 00:19:53,877 INFO L226 Difference]: Without dead ends: 616 [2019-11-16 00:19:53,879 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:19:53,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-11-16 00:19:53,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 616. [2019-11-16 00:19:53,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-11-16 00:19:53,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 918 transitions. [2019-11-16 00:19:53,913 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 918 transitions. Word has length 76 [2019-11-16 00:19:53,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:53,914 INFO L462 AbstractCegarLoop]: Abstraction has 616 states and 918 transitions. [2019-11-16 00:19:53,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:53,914 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 918 transitions. [2019-11-16 00:19:53,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-16 00:19:53,917 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:53,917 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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] [2019-11-16 00:19:54,120 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:19:54,120 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:19:54,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:19:54,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1308457232, now seen corresponding path program 1 times [2019-11-16 00:19:54,121 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:19:54,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [916878161] [2019-11-16 00:19:54,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:19:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:19:55,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:19:55,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:19:55,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:19:55,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:19:55,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:55,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:55,743 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:55,743 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:19:55,780 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:55,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:19:55,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:55,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:55,783 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:55,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:19:55,817 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 115 proven. 3 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-16 00:19:55,817 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:19:55,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:19:55,849 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:19:55,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:55,850 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:55,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:19:55,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:19:55,851 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:19:55,865 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-16 00:19:55,866 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [916878161] [2019-11-16 00:19:55,866 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:19:55,866 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:19:55,866 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610795732] [2019-11-16 00:19:55,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:19:55,867 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:19:55,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:19:55,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:19:55,868 INFO L87 Difference]: Start difference. First operand 616 states and 918 transitions. Second operand 4 states. [2019-11-16 00:19:59,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:59,784 INFO L93 Difference]: Finished difference Result 1765 states and 2640 transitions. [2019-11-16 00:19:59,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:19:59,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-16 00:19:59,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:59,795 INFO L225 Difference]: With dead ends: 1765 [2019-11-16 00:19:59,795 INFO L226 Difference]: Without dead ends: 1156 [2019-11-16 00:19:59,797 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:19:59,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2019-11-16 00:19:59,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 724. [2019-11-16 00:19:59,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-11-16 00:19:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1098 transitions. [2019-11-16 00:19:59,834 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1098 transitions. Word has length 117 [2019-11-16 00:19:59,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:59,835 INFO L462 AbstractCegarLoop]: Abstraction has 724 states and 1098 transitions. [2019-11-16 00:19:59,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:19:59,835 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1098 transitions. [2019-11-16 00:19:59,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-16 00:19:59,837 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:19:59,838 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:20:00,046 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:20:00,047 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:00,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:00,047 INFO L82 PathProgramCache]: Analyzing trace with hash 102464945, now seen corresponding path program 1 times [2019-11-16 00:20:00,047 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:20:00,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [372554454] [2019-11-16 00:20:00,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:20:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:01,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:20:01,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:20:01,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:20:01,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:20:01,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:01,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:01,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:01,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:20:01,643 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:01,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:20:01,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:01,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:01,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:01,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:20:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 119 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-16 00:20:01,675 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:20:01,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:20:01,708 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:01,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:01,715 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:01,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:01,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:01,717 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:20:01,729 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-16 00:20:01,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [372554454] [2019-11-16 00:20:01,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:20:01,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:20:01,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991177986] [2019-11-16 00:20:01,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:20:01,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:20:01,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:20:01,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:20:01,733 INFO L87 Difference]: Start difference. First operand 724 states and 1098 transitions. Second operand 4 states. [2019-11-16 00:20:05,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:05,398 INFO L93 Difference]: Finished difference Result 1958 states and 2963 transitions. [2019-11-16 00:20:05,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:20:05,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-16 00:20:05,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:05,408 INFO L225 Difference]: With dead ends: 1958 [2019-11-16 00:20:05,408 INFO L226 Difference]: Without dead ends: 1241 [2019-11-16 00:20:05,410 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:20:05,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2019-11-16 00:20:05,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 820. [2019-11-16 00:20:05,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2019-11-16 00:20:05,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1259 transitions. [2019-11-16 00:20:05,442 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1259 transitions. Word has length 118 [2019-11-16 00:20:05,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:05,443 INFO L462 AbstractCegarLoop]: Abstraction has 820 states and 1259 transitions. [2019-11-16 00:20:05,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:20:05,444 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1259 transitions. [2019-11-16 00:20:05,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-16 00:20:05,446 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:05,447 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:20:05,663 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:20:05,663 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:05,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:05,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1009197852, now seen corresponding path program 1 times [2019-11-16 00:20:05,664 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:20:05,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1503431967] [2019-11-16 00:20:05,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:20:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:07,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:20:07,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:20:07,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:20:07,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:20:07,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:07,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:07,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:07,615 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:20:07,641 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:07,641 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:20:07,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:07,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:07,643 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:07,643 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:20:07,705 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-11-16 00:20:07,705 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:20:07,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:20:07,747 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:07,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:07,748 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:07,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:07,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:07,749 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:20:07,766 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-11-16 00:20:07,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1503431967] [2019-11-16 00:20:07,767 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:20:07,767 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:20:07,768 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77681614] [2019-11-16 00:20:07,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:20:07,768 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:20:07,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:20:07,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:20:07,769 INFO L87 Difference]: Start difference. First operand 820 states and 1259 transitions. Second operand 4 states. [2019-11-16 00:20:11,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:11,260 INFO L93 Difference]: Finished difference Result 2050 states and 3127 transitions. [2019-11-16 00:20:11,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:20:11,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-11-16 00:20:11,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:11,268 INFO L225 Difference]: With dead ends: 2050 [2019-11-16 00:20:11,269 INFO L226 Difference]: Without dead ends: 1355 [2019-11-16 00:20:11,270 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:20:11,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2019-11-16 00:20:11,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 916. [2019-11-16 00:20:11,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-11-16 00:20:11,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1410 transitions. [2019-11-16 00:20:11,307 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1410 transitions. Word has length 132 [2019-11-16 00:20:11,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:11,307 INFO L462 AbstractCegarLoop]: Abstraction has 916 states and 1410 transitions. [2019-11-16 00:20:11,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:20:11,308 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1410 transitions. [2019-11-16 00:20:11,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-16 00:20:11,310 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:11,310 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:20:11,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:20:11,524 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:11,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:11,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1121242566, now seen corresponding path program 1 times [2019-11-16 00:20:11,525 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:20:11,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1985476213] [2019-11-16 00:20:11,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:20:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:13,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:20:13,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:20:13,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:20:13,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:20:13,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:13,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:13,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:13,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:20:13,905 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:13,905 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:20:13,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:13,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:13,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:13,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:20:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 176 proven. 4 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-11-16 00:20:13,939 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:20:13,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:20:13,970 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:13,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:13,971 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:13,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:13,972 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:13,972 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:20:13,987 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-11-16 00:20:13,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1985476213] [2019-11-16 00:20:13,987 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:20:13,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:20:13,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931916586] [2019-11-16 00:20:13,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:20:13,988 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:20:13,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:20:13,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:20:13,989 INFO L87 Difference]: Start difference. First operand 916 states and 1410 transitions. Second operand 4 states. [2019-11-16 00:20:18,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:18,204 INFO L93 Difference]: Finished difference Result 2113 states and 3221 transitions. [2019-11-16 00:20:18,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:20:18,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-16 00:20:18,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:18,212 INFO L225 Difference]: With dead ends: 2113 [2019-11-16 00:20:18,212 INFO L226 Difference]: Without dead ends: 1338 [2019-11-16 00:20:18,214 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:20:18,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2019-11-16 00:20:18,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 922. [2019-11-16 00:20:18,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 922 states. [2019-11-16 00:20:18,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1411 transitions. [2019-11-16 00:20:18,251 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1411 transitions. Word has length 134 [2019-11-16 00:20:18,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:18,251 INFO L462 AbstractCegarLoop]: Abstraction has 922 states and 1411 transitions. [2019-11-16 00:20:18,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:20:18,251 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1411 transitions. [2019-11-16 00:20:18,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-16 00:20:18,254 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:18,254 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:20:18,471 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:20:18,472 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:18,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:18,472 INFO L82 PathProgramCache]: Analyzing trace with hash -491470196, now seen corresponding path program 1 times [2019-11-16 00:20:18,473 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:20:18,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1847669322] [2019-11-16 00:20:18,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:20:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:19,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:20:19,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:20:19,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:20:19,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:20:19,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:19,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:19,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:19,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:20:19,446 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:19,447 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:20:19,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:19,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:19,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:19,451 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:20:19,474 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 216 proven. 5 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-11-16 00:20:19,474 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:20:19,513 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-11-16 00:20:19,518 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:19,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:19,520 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:19,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:19,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:19,524 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-16 00:20:19,555 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-11-16 00:20:19,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1847669322] [2019-11-16 00:20:19,556 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:20:19,556 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:20:19,556 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120769381] [2019-11-16 00:20:19,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:20:19,557 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:20:19,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:20:19,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:20:19,558 INFO L87 Difference]: Start difference. First operand 922 states and 1411 transitions. Second operand 4 states. [2019-11-16 00:20:23,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:23,931 INFO L93 Difference]: Finished difference Result 2263 states and 3432 transitions. [2019-11-16 00:20:23,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:20:23,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-11-16 00:20:23,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:23,938 INFO L225 Difference]: With dead ends: 2263 [2019-11-16 00:20:23,939 INFO L226 Difference]: Without dead ends: 1348 [2019-11-16 00:20:23,940 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:20:23,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2019-11-16 00:20:23,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 925. [2019-11-16 00:20:23,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 925 states. [2019-11-16 00:20:23,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1398 transitions. [2019-11-16 00:20:23,979 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1398 transitions. Word has length 160 [2019-11-16 00:20:23,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:23,979 INFO L462 AbstractCegarLoop]: Abstraction has 925 states and 1398 transitions. [2019-11-16 00:20:23,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:20:23,979 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1398 transitions. [2019-11-16 00:20:23,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-16 00:20:23,982 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:23,982 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:20:24,188 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:20:24,189 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:24,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:24,190 INFO L82 PathProgramCache]: Analyzing trace with hash -2121185490, now seen corresponding path program 1 times [2019-11-16 00:20:24,190 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:20:24,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1523394871] [2019-11-16 00:20:24,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:20:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:25,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:20:25,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:20:25,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:20:25,600 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:20:25,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:25,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:25,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:25,609 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:20:25,629 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:25,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:20:25,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:25,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:25,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:25,633 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:20:25,666 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 223 proven. 4 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-11-16 00:20:25,667 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:20:25,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:20:25,697 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:25,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:25,698 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:25,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:25,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:25,701 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:20:25,718 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-11-16 00:20:25,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1523394871] [2019-11-16 00:20:25,719 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:20:25,719 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:20:25,719 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728506360] [2019-11-16 00:20:25,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:20:25,720 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:20:25,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:20:25,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:20:25,721 INFO L87 Difference]: Start difference. First operand 925 states and 1398 transitions. Second operand 4 states. [2019-11-16 00:20:27,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:27,815 INFO L93 Difference]: Finished difference Result 2256 states and 3387 transitions. [2019-11-16 00:20:27,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:20:27,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-11-16 00:20:27,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:27,832 INFO L225 Difference]: With dead ends: 2256 [2019-11-16 00:20:27,833 INFO L226 Difference]: Without dead ends: 1341 [2019-11-16 00:20:27,834 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:20:27,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2019-11-16 00:20:27,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 925. [2019-11-16 00:20:27,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 925 states. [2019-11-16 00:20:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1381 transitions. [2019-11-16 00:20:27,871 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1381 transitions. Word has length 160 [2019-11-16 00:20:27,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:27,871 INFO L462 AbstractCegarLoop]: Abstraction has 925 states and 1381 transitions. [2019-11-16 00:20:27,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:20:27,871 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1381 transitions. [2019-11-16 00:20:27,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-16 00:20:27,874 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:27,874 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:20:28,090 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:20:28,091 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:28,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:28,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1031834531, now seen corresponding path program 1 times [2019-11-16 00:20:28,092 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:20:28,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [883864962] [2019-11-16 00:20:28,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:20:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:29,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:20:29,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:20:29,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:20:29,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:20:29,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:29,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:29,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:29,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:20:29,453 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:29,453 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:20:29,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:29,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:29,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:29,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:20:29,487 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 230 proven. 4 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-11-16 00:20:29,487 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:20:29,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:20:29,506 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:29,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:29,507 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:29,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:29,508 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:29,508 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:20:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-11-16 00:20:29,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [883864962] [2019-11-16 00:20:29,521 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:20:29,521 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:20:29,521 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795375239] [2019-11-16 00:20:29,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:20:29,522 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:20:29,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:20:29,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:20:29,522 INFO L87 Difference]: Start difference. First operand 925 states and 1381 transitions. Second operand 4 states. [2019-11-16 00:20:32,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:32,450 INFO L93 Difference]: Finished difference Result 2256 states and 3353 transitions. [2019-11-16 00:20:32,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:20:32,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-16 00:20:32,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:32,457 INFO L225 Difference]: With dead ends: 2256 [2019-11-16 00:20:32,457 INFO L226 Difference]: Without dead ends: 1341 [2019-11-16 00:20:32,459 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:20:32,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2019-11-16 00:20:32,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 925. [2019-11-16 00:20:32,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 925 states. [2019-11-16 00:20:32,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1364 transitions. [2019-11-16 00:20:32,534 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1364 transitions. Word has length 161 [2019-11-16 00:20:32,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:32,535 INFO L462 AbstractCegarLoop]: Abstraction has 925 states and 1364 transitions. [2019-11-16 00:20:32,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:20:32,535 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1364 transitions. [2019-11-16 00:20:32,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-16 00:20:32,538 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:32,538 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:20:32,745 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:20:32,746 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:32,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:32,746 INFO L82 PathProgramCache]: Analyzing trace with hash 389808233, now seen corresponding path program 1 times [2019-11-16 00:20:32,746 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:20:32,746 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1125294673] [2019-11-16 00:20:32,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:20:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:34,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:20:34,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:20:34,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:20:34,046 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:20:34,047 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:34,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:34,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:34,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:20:34,077 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:34,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:20:34,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:34,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:34,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:34,080 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:20:34,115 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 237 proven. 4 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-11-16 00:20:34,116 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:20:34,143 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:20:34,148 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:34,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:34,152 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:34,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:34,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:34,154 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:20:34,168 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-11-16 00:20:34,168 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1125294673] [2019-11-16 00:20:34,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:20:34,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:20:34,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724710868] [2019-11-16 00:20:34,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:20:34,169 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:20:34,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:20:34,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:20:34,170 INFO L87 Difference]: Start difference. First operand 925 states and 1364 transitions. Second operand 4 states. [2019-11-16 00:20:37,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:37,120 INFO L93 Difference]: Finished difference Result 2256 states and 3319 transitions. [2019-11-16 00:20:37,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:20:37,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-11-16 00:20:37,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:37,126 INFO L225 Difference]: With dead ends: 2256 [2019-11-16 00:20:37,127 INFO L226 Difference]: Without dead ends: 1341 [2019-11-16 00:20:37,128 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:20:37,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2019-11-16 00:20:37,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 925. [2019-11-16 00:20:37,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 925 states. [2019-11-16 00:20:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1347 transitions. [2019-11-16 00:20:37,164 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1347 transitions. Word has length 162 [2019-11-16 00:20:37,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:37,165 INFO L462 AbstractCegarLoop]: Abstraction has 925 states and 1347 transitions. [2019-11-16 00:20:37,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:20:37,165 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1347 transitions. [2019-11-16 00:20:37,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-16 00:20:37,167 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:37,168 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:20:37,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:20:37,375 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:37,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:37,376 INFO L82 PathProgramCache]: Analyzing trace with hash -772404936, now seen corresponding path program 1 times [2019-11-16 00:20:37,376 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:20:37,377 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1291702524] [2019-11-16 00:20:37,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:20:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:38,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:20:38,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:20:38,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:20:38,766 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:20:38,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:38,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:38,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:38,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:20:38,793 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:38,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:20:38,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:38,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:38,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:38,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:20:38,827 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 244 proven. 4 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-11-16 00:20:38,827 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:20:38,850 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:20:38,851 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:38,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:38,852 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:38,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:38,853 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:38,853 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:20:38,867 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-11-16 00:20:38,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1291702524] [2019-11-16 00:20:38,867 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:20:38,867 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:20:38,867 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840423149] [2019-11-16 00:20:38,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:20:38,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:20:38,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:20:38,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:20:38,868 INFO L87 Difference]: Start difference. First operand 925 states and 1347 transitions. Second operand 4 states. [2019-11-16 00:20:43,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:43,054 INFO L93 Difference]: Finished difference Result 2256 states and 3285 transitions. [2019-11-16 00:20:43,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:20:43,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-16 00:20:43,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:43,061 INFO L225 Difference]: With dead ends: 2256 [2019-11-16 00:20:43,061 INFO L226 Difference]: Without dead ends: 1341 [2019-11-16 00:20:43,062 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:20:43,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2019-11-16 00:20:43,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 925. [2019-11-16 00:20:43,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 925 states. [2019-11-16 00:20:43,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1330 transitions. [2019-11-16 00:20:43,099 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1330 transitions. Word has length 163 [2019-11-16 00:20:43,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:43,100 INFO L462 AbstractCegarLoop]: Abstraction has 925 states and 1330 transitions. [2019-11-16 00:20:43,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:20:43,100 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1330 transitions. [2019-11-16 00:20:43,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-16 00:20:43,103 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:43,103 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:20:43,311 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:20:43,311 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:43,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:43,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1567317062, now seen corresponding path program 1 times [2019-11-16 00:20:43,312 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:20:43,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [871559157] [2019-11-16 00:20:43,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:20:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:45,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:20:45,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:20:45,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:20:45,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:20:45,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:45,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:45,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:45,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:20:45,102 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:45,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:20:45,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:45,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:45,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:45,104 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:20:45,147 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-16 00:20:45,147 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:20:45,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:20:45,168 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:45,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:45,169 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:45,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:45,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:45,170 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:20:45,190 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-16 00:20:45,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [871559157] [2019-11-16 00:20:45,190 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:45,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:20:45,190 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199187050] [2019-11-16 00:20:45,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:20:45,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:20:45,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:20:45,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:20:45,192 INFO L87 Difference]: Start difference. First operand 925 states and 1330 transitions. Second operand 7 states. [2019-11-16 00:20:53,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:53,073 INFO L93 Difference]: Finished difference Result 2820 states and 4043 transitions. [2019-11-16 00:20:53,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:20:53,075 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 167 [2019-11-16 00:20:53,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:53,083 INFO L225 Difference]: With dead ends: 2820 [2019-11-16 00:20:53,083 INFO L226 Difference]: Without dead ends: 1905 [2019-11-16 00:20:53,085 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:20:53,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2019-11-16 00:20:53,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 1153. [2019-11-16 00:20:53,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2019-11-16 00:20:53,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1684 transitions. [2019-11-16 00:20:53,133 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1684 transitions. Word has length 167 [2019-11-16 00:20:53,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:53,134 INFO L462 AbstractCegarLoop]: Abstraction has 1153 states and 1684 transitions. [2019-11-16 00:20:53,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:20:53,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1684 transitions. [2019-11-16 00:20:53,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-16 00:20:53,137 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:53,138 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:20:53,347 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:20:53,348 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:53,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:53,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1463899349, now seen corresponding path program 1 times [2019-11-16 00:20:53,349 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:20:53,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [761919429] [2019-11-16 00:20:53,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:20:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:55,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:20:55,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:20:55,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:20:55,191 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:20:55,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:55,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:55,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:55,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:20:55,229 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:55,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:20:55,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:55,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:55,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:55,241 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:20:55,294 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-16 00:20:55,295 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:20:55,325 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:20:55,330 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:20:55,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:55,331 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:55,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:20:55,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:20:55,332 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:20:55,363 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-16 00:20:55,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [761919429] [2019-11-16 00:20:55,364 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:55,364 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:20:55,364 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576867642] [2019-11-16 00:20:55,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:20:55,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:20:55,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:20:55,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:20:55,367 INFO L87 Difference]: Start difference. First operand 1153 states and 1684 transitions. Second operand 7 states. [2019-11-16 00:21:03,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:03,579 INFO L93 Difference]: Finished difference Result 3138 states and 4577 transitions. [2019-11-16 00:21:03,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:21:03,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 168 [2019-11-16 00:21:03,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:03,590 INFO L225 Difference]: With dead ends: 3138 [2019-11-16 00:21:03,591 INFO L226 Difference]: Without dead ends: 1995 [2019-11-16 00:21:03,593 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:21:03,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2019-11-16 00:21:03,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1261. [2019-11-16 00:21:03,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1261 states. [2019-11-16 00:21:03,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1894 transitions. [2019-11-16 00:21:03,642 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1894 transitions. Word has length 168 [2019-11-16 00:21:03,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:03,643 INFO L462 AbstractCegarLoop]: Abstraction has 1261 states and 1894 transitions. [2019-11-16 00:21:03,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:21:03,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1894 transitions. [2019-11-16 00:21:03,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-16 00:21:03,646 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:03,647 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:03,856 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:21:03,856 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:21:03,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:03,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1324821863, now seen corresponding path program 1 times [2019-11-16 00:21:03,857 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:21:03,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1361122520] [2019-11-16 00:21:03,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:21:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:05,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:21:05,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:21:05,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:21:05,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:21:05,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:05,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:05,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:05,298 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:21:05,325 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:05,325 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:21:05,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:05,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:05,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:05,327 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:21:05,370 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-16 00:21:05,370 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:21:05,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:21:05,392 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:05,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:05,393 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:05,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:05,394 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:05,394 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:21:05,424 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-16 00:21:05,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1361122520] [2019-11-16 00:21:05,425 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:05,425 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:21:05,425 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663400409] [2019-11-16 00:21:05,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:21:05,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:21:05,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:21:05,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:21:05,426 INFO L87 Difference]: Start difference. First operand 1261 states and 1894 transitions. Second operand 7 states. [2019-11-16 00:21:13,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:13,453 INFO L93 Difference]: Finished difference Result 3438 states and 5081 transitions. [2019-11-16 00:21:13,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:21:13,453 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2019-11-16 00:21:13,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:13,463 INFO L225 Difference]: With dead ends: 3438 [2019-11-16 00:21:13,463 INFO L226 Difference]: Without dead ends: 2175 [2019-11-16 00:21:13,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:21:13,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2175 states. [2019-11-16 00:21:13,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2175 to 1513. [2019-11-16 00:21:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2019-11-16 00:21:13,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2290 transitions. [2019-11-16 00:21:13,521 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2290 transitions. Word has length 170 [2019-11-16 00:21:13,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:13,521 INFO L462 AbstractCegarLoop]: Abstraction has 1513 states and 2290 transitions. [2019-11-16 00:21:13,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:21:13,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2290 transitions. [2019-11-16 00:21:13,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-16 00:21:13,525 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:13,526 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:13,733 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:21:13,733 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:21:13,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:13,733 INFO L82 PathProgramCache]: Analyzing trace with hash 26415375, now seen corresponding path program 1 times [2019-11-16 00:21:13,734 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:21:13,734 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [496867268] [2019-11-16 00:21:13,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:21:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:16,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:21:16,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:21:16,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:21:16,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:21:16,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:16,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:16,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:16,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:21:16,688 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:16,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:21:16,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:16,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:16,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:16,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:21:16,767 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-16 00:21:16,767 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:21:16,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:21:16,803 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:16,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:16,805 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:16,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:16,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:16,806 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:21:16,885 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-16 00:21:16,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [496867268] [2019-11-16 00:21:16,886 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:16,886 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:21:16,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047778483] [2019-11-16 00:21:16,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:21:16,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:21:16,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:21:16,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:21:16,889 INFO L87 Difference]: Start difference. First operand 1513 states and 2290 transitions. Second operand 7 states. [2019-11-16 00:21:24,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:24,848 INFO L93 Difference]: Finished difference Result 3978 states and 5927 transitions. [2019-11-16 00:21:24,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:21:24,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 198 [2019-11-16 00:21:24,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:24,858 INFO L225 Difference]: With dead ends: 3978 [2019-11-16 00:21:24,858 INFO L226 Difference]: Without dead ends: 2475 [2019-11-16 00:21:24,859 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:21:24,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2019-11-16 00:21:24,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 1711. [2019-11-16 00:21:24,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1711 states. [2019-11-16 00:21:24,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2578 transitions. [2019-11-16 00:21:24,918 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2578 transitions. Word has length 198 [2019-11-16 00:21:24,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:24,919 INFO L462 AbstractCegarLoop]: Abstraction has 1711 states and 2578 transitions. [2019-11-16 00:21:24,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:21:24,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2578 transitions. [2019-11-16 00:21:24,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-16 00:21:24,924 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:24,924 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:25,142 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:21:25,142 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:21:25,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:25,143 INFO L82 PathProgramCache]: Analyzing trace with hash 965328940, now seen corresponding path program 1 times [2019-11-16 00:21:25,143 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:21:25,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [627024439] [2019-11-16 00:21:25,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:21:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:27,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:21:27,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:21:27,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:21:27,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:21:27,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:27,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:27,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:27,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:21:27,504 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:27,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:21:27,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:27,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:27,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:27,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:21:27,571 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-16 00:21:27,572 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:21:27,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:21:27,605 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:27,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:27,606 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:27,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:27,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:27,607 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:21:27,643 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-16 00:21:27,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [627024439] [2019-11-16 00:21:27,644 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:27,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:21:27,644 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690803779] [2019-11-16 00:21:27,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:21:27,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:21:27,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:21:27,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:21:27,646 INFO L87 Difference]: Start difference. First operand 1711 states and 2578 transitions. Second operand 7 states. [2019-11-16 00:21:34,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:34,588 INFO L93 Difference]: Finished difference Result 4368 states and 6485 transitions. [2019-11-16 00:21:34,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:21:34,593 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 198 [2019-11-16 00:21:34,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:34,603 INFO L225 Difference]: With dead ends: 4368 [2019-11-16 00:21:34,603 INFO L226 Difference]: Without dead ends: 2667 [2019-11-16 00:21:34,606 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:21:34,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2019-11-16 00:21:34,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 1915. [2019-11-16 00:21:34,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1915 states. [2019-11-16 00:21:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 2878 transitions. [2019-11-16 00:21:34,695 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 2878 transitions. Word has length 198 [2019-11-16 00:21:34,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:34,695 INFO L462 AbstractCegarLoop]: Abstraction has 1915 states and 2878 transitions. [2019-11-16 00:21:34,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:21:34,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2878 transitions. [2019-11-16 00:21:34,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-16 00:21:34,699 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:34,700 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:34,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:21:34,912 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:21:34,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:34,912 INFO L82 PathProgramCache]: Analyzing trace with hash -868111170, now seen corresponding path program 1 times [2019-11-16 00:21:34,913 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:21:34,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [255431386] [2019-11-16 00:21:34,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:21:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:37,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:21:37,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:21:37,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:21:37,676 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:21:37,677 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:37,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:37,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:37,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:21:37,707 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:37,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:21:37,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:37,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:37,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:37,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:21:37,755 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-16 00:21:37,755 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:21:37,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:21:37,804 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:37,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:37,805 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:37,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:37,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:37,805 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:21:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-16 00:21:37,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [255431386] [2019-11-16 00:21:37,836 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:37,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:21:37,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422678140] [2019-11-16 00:21:37,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:21:37,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:21:37,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:21:37,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:21:37,839 INFO L87 Difference]: Start difference. First operand 1915 states and 2878 transitions. Second operand 7 states. [2019-11-16 00:21:44,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:44,633 INFO L93 Difference]: Finished difference Result 4512 states and 6671 transitions. [2019-11-16 00:21:44,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:21:44,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 199 [2019-11-16 00:21:44,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:44,645 INFO L225 Difference]: With dead ends: 4512 [2019-11-16 00:21:44,645 INFO L226 Difference]: Without dead ends: 2607 [2019-11-16 00:21:44,648 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:21:44,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2607 states. [2019-11-16 00:21:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2607 to 1915. [2019-11-16 00:21:44,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1915 states. [2019-11-16 00:21:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 2854 transitions. [2019-11-16 00:21:44,716 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 2854 transitions. Word has length 199 [2019-11-16 00:21:44,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:44,717 INFO L462 AbstractCegarLoop]: Abstraction has 1915 states and 2854 transitions. [2019-11-16 00:21:44,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:21:44,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2854 transitions. [2019-11-16 00:21:44,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-16 00:21:44,720 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:44,721 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:44,932 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:21:44,932 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:21:44,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:44,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1135081669, now seen corresponding path program 1 times [2019-11-16 00:21:44,933 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:21:44,933 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [587344097] [2019-11-16 00:21:44,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:21:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:47,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:21:47,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:21:47,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:21:47,539 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:21:47,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:47,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:47,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:47,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:21:47,563 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:47,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:21:47,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:47,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:47,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:47,565 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:21:47,645 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-16 00:21:47,645 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:21:47,665 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:21:47,667 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:47,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:47,668 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:47,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:47,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:47,669 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:21:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-16 00:21:47,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [587344097] [2019-11-16 00:21:47,697 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:47,697 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:21:47,697 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139571568] [2019-11-16 00:21:47,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:21:47,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:21:47,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:21:47,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:21:47,698 INFO L87 Difference]: Start difference. First operand 1915 states and 2854 transitions. Second operand 7 states. [2019-11-16 00:21:54,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:54,742 INFO L93 Difference]: Finished difference Result 4500 states and 6605 transitions. [2019-11-16 00:21:54,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:21:54,743 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 199 [2019-11-16 00:21:54,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:54,748 INFO L225 Difference]: With dead ends: 4500 [2019-11-16 00:21:54,749 INFO L226 Difference]: Without dead ends: 2595 [2019-11-16 00:21:54,751 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:21:54,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2595 states. [2019-11-16 00:21:54,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2595 to 1915. [2019-11-16 00:21:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1915 states. [2019-11-16 00:21:54,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 2836 transitions. [2019-11-16 00:21:54,799 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 2836 transitions. Word has length 199 [2019-11-16 00:21:54,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:54,799 INFO L462 AbstractCegarLoop]: Abstraction has 1915 states and 2836 transitions. [2019-11-16 00:21:54,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:21:54,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2836 transitions. [2019-11-16 00:21:54,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-11-16 00:21:54,802 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:54,802 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:55,009 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:21:55,009 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:21:55,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:55,009 INFO L82 PathProgramCache]: Analyzing trace with hash 2009994873, now seen corresponding path program 1 times [2019-11-16 00:21:55,010 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:21:55,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [803731227] [2019-11-16 00:21:55,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:21:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:56,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:21:56,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:21:56,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:21:56,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:21:56,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:56,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:56,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:56,925 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:21:56,948 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:56,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:21:56,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:56,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:56,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:56,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:21:57,029 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-16 00:21:57,029 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:21:57,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:21:57,069 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:21:57,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:57,070 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:57,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:21:57,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:21:57,071 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:21:57,110 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-16 00:21:57,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [803731227] [2019-11-16 00:21:57,111 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:57,111 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:21:57,111 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173437245] [2019-11-16 00:21:57,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:21:57,112 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:21:57,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:21:57,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:21:57,113 INFO L87 Difference]: Start difference. First operand 1915 states and 2836 transitions. Second operand 7 states. [2019-11-16 00:22:03,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:03,833 INFO L93 Difference]: Finished difference Result 4896 states and 7141 transitions. [2019-11-16 00:22:03,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:22:03,834 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 206 [2019-11-16 00:22:03,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:03,839 INFO L225 Difference]: With dead ends: 4896 [2019-11-16 00:22:03,839 INFO L226 Difference]: Without dead ends: 2991 [2019-11-16 00:22:03,841 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:22:03,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2019-11-16 00:22:03,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 2325. [2019-11-16 00:22:03,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2325 states. [2019-11-16 00:22:03,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 2325 states and 3434 transitions. [2019-11-16 00:22:03,894 INFO L78 Accepts]: Start accepts. Automaton has 2325 states and 3434 transitions. Word has length 206 [2019-11-16 00:22:03,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:03,895 INFO L462 AbstractCegarLoop]: Abstraction has 2325 states and 3434 transitions. [2019-11-16 00:22:03,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:22:03,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 3434 transitions. [2019-11-16 00:22:03,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-16 00:22:03,897 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:03,898 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:04,098 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:04,098 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:04,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:04,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1431383896, now seen corresponding path program 1 times [2019-11-16 00:22:04,099 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:22:04,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [632959564] [2019-11-16 00:22:04,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:05,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:22:05,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:05,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:22:05,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:22:05,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:22:05,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:05,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:22:05,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:22:05,881 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:05,881 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:22:05,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:22:05,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:05,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:22:05,883 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:22:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-16 00:22:05,939 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:22:05,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:22:05,970 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:22:05,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:05,971 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:22:05,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:05,972 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:22:05,972 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:22:06,001 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-16 00:22:06,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [632959564] [2019-11-16 00:22:06,002 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:06,002 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:22:06,002 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033489750] [2019-11-16 00:22:06,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:22:06,003 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:22:06,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:22:06,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:22:06,003 INFO L87 Difference]: Start difference. First operand 2325 states and 3434 transitions. Second operand 7 states. [2019-11-16 00:22:12,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:12,684 INFO L93 Difference]: Finished difference Result 5302 states and 7729 transitions. [2019-11-16 00:22:12,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:22:12,686 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 207 [2019-11-16 00:22:12,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:12,691 INFO L225 Difference]: With dead ends: 5302 [2019-11-16 00:22:12,691 INFO L226 Difference]: Without dead ends: 2963 [2019-11-16 00:22:12,694 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:22:12,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2019-11-16 00:22:12,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 2337. [2019-11-16 00:22:12,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2337 states. [2019-11-16 00:22:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 3454 transitions. [2019-11-16 00:22:12,824 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 3454 transitions. Word has length 207 [2019-11-16 00:22:12,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:12,824 INFO L462 AbstractCegarLoop]: Abstraction has 2337 states and 3454 transitions. [2019-11-16 00:22:12,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:22:12,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 3454 transitions. [2019-11-16 00:22:12,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-16 00:22:12,828 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:12,829 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:13,037 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:13,038 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:13,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:13,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1688707629, now seen corresponding path program 1 times [2019-11-16 00:22:13,039 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:22:13,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [322254424] [2019-11-16 00:22:13,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:15,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:22:15,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:15,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:22:15,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:22:15,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:22:15,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:15,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:22:15,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:22:15,821 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:15,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:22:15,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:22:15,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:15,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:22:15,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:22:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-16 00:22:15,889 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:22:15,921 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:22:15,923 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:22:15,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:15,924 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:22:15,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:15,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:22:15,925 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:22:15,965 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-16 00:22:15,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [322254424] [2019-11-16 00:22:15,966 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:15,966 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:22:15,966 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077765173] [2019-11-16 00:22:15,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:22:15,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:22:15,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:22:15,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:22:15,967 INFO L87 Difference]: Start difference. First operand 2337 states and 3454 transitions. Second operand 7 states. [2019-11-16 00:22:21,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:21,706 INFO L93 Difference]: Finished difference Result 5290 states and 7703 transitions. [2019-11-16 00:22:21,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:22:21,708 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 207 [2019-11-16 00:22:21,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:21,712 INFO L225 Difference]: With dead ends: 5290 [2019-11-16 00:22:21,712 INFO L226 Difference]: Without dead ends: 2963 [2019-11-16 00:22:21,715 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:22:21,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2019-11-16 00:22:21,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 2337. [2019-11-16 00:22:21,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2337 states. [2019-11-16 00:22:21,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 3432 transitions. [2019-11-16 00:22:21,791 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 3432 transitions. Word has length 207 [2019-11-16 00:22:21,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:21,792 INFO L462 AbstractCegarLoop]: Abstraction has 2337 states and 3432 transitions. [2019-11-16 00:22:21,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:22:21,792 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 3432 transitions. [2019-11-16 00:22:21,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-16 00:22:21,795 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:21,796 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:22,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:22,004 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:22,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:22,005 INFO L82 PathProgramCache]: Analyzing trace with hash 388419812, now seen corresponding path program 1 times [2019-11-16 00:22:22,005 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:22:22,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1156882690] [2019-11-16 00:22:22,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:24,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:22:24,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:24,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:22:24,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:22:24,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:22:24,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:24,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:22:24,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:22:24,810 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:24,811 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:22:24,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:22:24,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:24,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:22:24,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:22:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-16 00:22:24,884 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:22:24,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:22:24,916 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:22:24,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:24,917 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:22:24,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:24,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:22:24,918 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:22:24,948 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-16 00:22:24,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1156882690] [2019-11-16 00:22:24,949 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:24,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:22:24,949 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913607702] [2019-11-16 00:22:24,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:22:24,950 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:22:24,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:22:24,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:22:24,950 INFO L87 Difference]: Start difference. First operand 2337 states and 3432 transitions. Second operand 7 states. [2019-11-16 00:22:32,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:32,640 INFO L93 Difference]: Finished difference Result 5266 states and 7629 transitions. [2019-11-16 00:22:32,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:22:32,642 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 208 [2019-11-16 00:22:32,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:32,646 INFO L225 Difference]: With dead ends: 5266 [2019-11-16 00:22:32,646 INFO L226 Difference]: Without dead ends: 2843 [2019-11-16 00:22:32,649 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:22:32,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2019-11-16 00:22:32,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2289. [2019-11-16 00:22:32,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2289 states. [2019-11-16 00:22:32,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2289 states to 2289 states and 3344 transitions. [2019-11-16 00:22:32,725 INFO L78 Accepts]: Start accepts. Automaton has 2289 states and 3344 transitions. Word has length 208 [2019-11-16 00:22:32,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:32,726 INFO L462 AbstractCegarLoop]: Abstraction has 2289 states and 3344 transitions. [2019-11-16 00:22:32,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:22:32,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2289 states and 3344 transitions. [2019-11-16 00:22:32,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-16 00:22:32,730 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:32,730 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:32,939 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:32,940 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:32,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:32,940 INFO L82 PathProgramCache]: Analyzing trace with hash -783938709, now seen corresponding path program 1 times [2019-11-16 00:22:32,941 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:22:32,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [422673772] [2019-11-16 00:22:32,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:35,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:22:35,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:35,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:22:35,697 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:22:35,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:22:35,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:35,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:22:35,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:22:35,723 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:35,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:22:35,723 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:22:35,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:35,725 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:22:35,725 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:22:35,795 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 368 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:22:35,795 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:22:35,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:22:35,816 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:22:35,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:35,818 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:22:35,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:35,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:22:35,819 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:22:35,846 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 368 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:22:35,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [422673772] [2019-11-16 00:22:35,846 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:35,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:22:35,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069602634] [2019-11-16 00:22:35,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:22:35,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:22:35,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:22:35,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:22:35,848 INFO L87 Difference]: Start difference. First operand 2289 states and 3344 transitions. Second operand 7 states. [2019-11-16 00:22:45,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:45,667 INFO L93 Difference]: Finished difference Result 5277 states and 7634 transitions. [2019-11-16 00:22:45,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:22:45,667 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 223 [2019-11-16 00:22:45,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:45,670 INFO L225 Difference]: With dead ends: 5277 [2019-11-16 00:22:45,670 INFO L226 Difference]: Without dead ends: 2998 [2019-11-16 00:22:45,671 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:22:45,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2019-11-16 00:22:45,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2419. [2019-11-16 00:22:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2419 states. [2019-11-16 00:22:45,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 3494 transitions. [2019-11-16 00:22:45,749 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 3494 transitions. Word has length 223 [2019-11-16 00:22:45,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:45,749 INFO L462 AbstractCegarLoop]: Abstraction has 2419 states and 3494 transitions. [2019-11-16 00:22:45,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:22:45,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 3494 transitions. [2019-11-16 00:22:45,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-16 00:22:45,753 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:45,753 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:45,962 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:45,971 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:45,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:45,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1088508018, now seen corresponding path program 1 times [2019-11-16 00:22:45,971 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:22:45,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1417824957] [2019-11-16 00:22:45,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:48,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:22:48,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:48,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:22:48,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:22:48,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:22:48,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:48,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:22:48,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:22:48,663 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:48,664 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:22:48,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:22:48,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:48,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:22:48,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:22:48,716 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:22:48,716 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:22:48,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:22:48,737 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:22:48,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:48,738 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:22:48,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:48,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:22:48,738 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:22:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:22:48,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1417824957] [2019-11-16 00:22:48,788 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:48,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:22:48,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820623501] [2019-11-16 00:22:48,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:22:48,789 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:22:48,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:22:48,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:22:48,790 INFO L87 Difference]: Start difference. First operand 2419 states and 3494 transitions. Second operand 7 states. [2019-11-16 00:22:55,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:55,970 INFO L93 Difference]: Finished difference Result 5568 states and 7969 transitions. [2019-11-16 00:22:55,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:22:55,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 223 [2019-11-16 00:22:55,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:22:55,973 INFO L225 Difference]: With dead ends: 5568 [2019-11-16 00:22:55,973 INFO L226 Difference]: Without dead ends: 3159 [2019-11-16 00:22:55,975 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:22:55,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3159 states. [2019-11-16 00:22:56,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3159 to 2587. [2019-11-16 00:22:56,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2587 states. [2019-11-16 00:22:56,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2587 states to 2587 states and 3700 transitions. [2019-11-16 00:22:56,059 INFO L78 Accepts]: Start accepts. Automaton has 2587 states and 3700 transitions. Word has length 223 [2019-11-16 00:22:56,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:22:56,060 INFO L462 AbstractCegarLoop]: Abstraction has 2587 states and 3700 transitions. [2019-11-16 00:22:56,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:22:56,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2587 states and 3700 transitions. [2019-11-16 00:22:56,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-16 00:22:56,064 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:22:56,064 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:56,267 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:56,267 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:22:56,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:56,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1945898820, now seen corresponding path program 1 times [2019-11-16 00:22:56,268 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:22:56,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [837434948] [2019-11-16 00:22:56,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:22:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:59,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:22:59,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:59,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:22:59,094 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:22:59,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:22:59,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:59,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:22:59,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:22:59,117 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:59,118 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:22:59,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:22:59,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:59,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:22:59,119 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:22:59,173 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:22:59,173 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:22:59,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:22:59,194 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:22:59,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:59,195 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:22:59,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:22:59,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:22:59,196 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:22:59,247 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:22:59,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [837434948] [2019-11-16 00:22:59,247 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:59,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:22:59,247 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758520198] [2019-11-16 00:22:59,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:22:59,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:22:59,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:22:59,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:22:59,248 INFO L87 Difference]: Start difference. First operand 2587 states and 3700 transitions. Second operand 7 states. [2019-11-16 00:23:06,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:06,158 INFO L93 Difference]: Finished difference Result 5697 states and 8071 transitions. [2019-11-16 00:23:06,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:23:06,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 224 [2019-11-16 00:23:06,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:06,162 INFO L225 Difference]: With dead ends: 5697 [2019-11-16 00:23:06,162 INFO L226 Difference]: Without dead ends: 3120 [2019-11-16 00:23:06,164 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:23:06,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2019-11-16 00:23:06,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2587. [2019-11-16 00:23:06,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2587 states. [2019-11-16 00:23:06,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2587 states to 2587 states and 3654 transitions. [2019-11-16 00:23:06,220 INFO L78 Accepts]: Start accepts. Automaton has 2587 states and 3654 transitions. Word has length 224 [2019-11-16 00:23:06,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:06,221 INFO L462 AbstractCegarLoop]: Abstraction has 2587 states and 3654 transitions. [2019-11-16 00:23:06,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:23:06,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2587 states and 3654 transitions. [2019-11-16 00:23:06,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-16 00:23:06,223 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:06,224 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:06,424 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:23:06,424 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:06,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:06,425 INFO L82 PathProgramCache]: Analyzing trace with hash -895517313, now seen corresponding path program 1 times [2019-11-16 00:23:06,425 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:23:06,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [146811333] [2019-11-16 00:23:06,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:23:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:09,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:23:09,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:09,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:23:09,153 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:23:09,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:09,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:09,161 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:09,161 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:23:09,177 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:09,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:23:09,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:09,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:09,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:09,179 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:23:09,228 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:23:09,228 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:23:09,274 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:23:09,276 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:09,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:09,277 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:09,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:09,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:09,278 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:23:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:23:09,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [146811333] [2019-11-16 00:23:09,309 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:09,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:23:09,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590871387] [2019-11-16 00:23:09,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:23:09,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:23:09,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:23:09,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:23:09,310 INFO L87 Difference]: Start difference. First operand 2587 states and 3654 transitions. Second operand 7 states. [2019-11-16 00:23:17,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:17,941 INFO L93 Difference]: Finished difference Result 5716 states and 8000 transitions. [2019-11-16 00:23:17,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:23:17,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 224 [2019-11-16 00:23:17,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:17,944 INFO L225 Difference]: With dead ends: 5716 [2019-11-16 00:23:17,944 INFO L226 Difference]: Without dead ends: 3139 [2019-11-16 00:23:17,946 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:23:17,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states. [2019-11-16 00:23:18,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 2605. [2019-11-16 00:23:18,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2019-11-16 00:23:18,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 3639 transitions. [2019-11-16 00:23:18,005 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 3639 transitions. Word has length 224 [2019-11-16 00:23:18,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:18,006 INFO L462 AbstractCegarLoop]: Abstraction has 2605 states and 3639 transitions. [2019-11-16 00:23:18,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:23:18,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 3639 transitions. [2019-11-16 00:23:18,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-11-16 00:23:18,008 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:18,008 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:18,209 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:23:18,210 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:18,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:18,210 INFO L82 PathProgramCache]: Analyzing trace with hash 968787187, now seen corresponding path program 1 times [2019-11-16 00:23:18,211 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:23:18,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1567919167] [2019-11-16 00:23:18,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:23:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:20,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:23:20,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:20,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:23:20,857 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:23:20,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:20,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:20,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:20,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:23:20,893 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:20,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:23:20,893 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:20,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:20,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:20,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:23:20,960 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:23:20,960 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:23:20,985 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:23:20,987 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:20,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:20,988 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:20,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:20,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:20,989 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:23:21,022 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:23:21,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1567919167] [2019-11-16 00:23:21,022 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:21,022 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:23:21,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31491562] [2019-11-16 00:23:21,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:23:21,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:23:21,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:23:21,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:23:21,023 INFO L87 Difference]: Start difference. First operand 2605 states and 3639 transitions. Second operand 7 states. [2019-11-16 00:23:27,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:27,301 INFO L93 Difference]: Finished difference Result 5715 states and 7912 transitions. [2019-11-16 00:23:27,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:23:27,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 225 [2019-11-16 00:23:27,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:27,304 INFO L225 Difference]: With dead ends: 5715 [2019-11-16 00:23:27,305 INFO L226 Difference]: Without dead ends: 3138 [2019-11-16 00:23:27,306 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:23:27,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2019-11-16 00:23:27,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2605. [2019-11-16 00:23:27,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2019-11-16 00:23:27,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 3599 transitions. [2019-11-16 00:23:27,375 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 3599 transitions. Word has length 225 [2019-11-16 00:23:27,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:27,375 INFO L462 AbstractCegarLoop]: Abstraction has 2605 states and 3599 transitions. [2019-11-16 00:23:27,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:23:27,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 3599 transitions. [2019-11-16 00:23:27,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-16 00:23:27,377 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:27,378 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:27,578 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:23:27,578 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:27,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:27,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1190755516, now seen corresponding path program 1 times [2019-11-16 00:23:27,579 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:23:27,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1014801980] [2019-11-16 00:23:27,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:23:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:30,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:23:30,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:30,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:23:30,230 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:23:30,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:30,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:30,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:30,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:23:30,254 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:30,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:23:30,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:30,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:30,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:30,256 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:23:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:23:30,328 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:23:30,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-16 00:23:30,351 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:30,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:30,352 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:30,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:30,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:30,353 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:23:30,383 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:23:30,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1014801980] [2019-11-16 00:23:30,383 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:30,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:23:30,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018150847] [2019-11-16 00:23:30,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:23:30,384 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:23:30,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:23:30,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:23:30,384 INFO L87 Difference]: Start difference. First operand 2605 states and 3599 transitions. Second operand 7 states. [2019-11-16 00:23:39,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:39,361 INFO L93 Difference]: Finished difference Result 5703 states and 7814 transitions. [2019-11-16 00:23:39,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:23:39,362 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 226 [2019-11-16 00:23:39,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:39,364 INFO L225 Difference]: With dead ends: 5703 [2019-11-16 00:23:39,364 INFO L226 Difference]: Without dead ends: 3054 [2019-11-16 00:23:39,366 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:23:39,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3054 states. [2019-11-16 00:23:39,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3054 to 2569. [2019-11-16 00:23:39,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2569 states. [2019-11-16 00:23:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 3511 transitions. [2019-11-16 00:23:39,426 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 3511 transitions. Word has length 226 [2019-11-16 00:23:39,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:39,427 INFO L462 AbstractCegarLoop]: Abstraction has 2569 states and 3511 transitions. [2019-11-16 00:23:39,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:23:39,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 3511 transitions. [2019-11-16 00:23:39,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-11-16 00:23:39,429 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:39,429 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:39,630 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:23:39,630 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:39,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:39,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1412157272, now seen corresponding path program 1 times [2019-11-16 00:23:39,631 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:23:39,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [740245299] [2019-11-16 00:23:39,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03acfa36-789b-4934-8dd4-9773202ec553/bin/uautomizer/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:23:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:45,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-16 00:23:45,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:54,469 INFO L235 Elim1Store]: Index analysis took 3823 ms [2019-11-16 00:23:54,486 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:54,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-11-16 00:23:54,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:08,025 WARN L191 SmtUtils]: Spent 13.54 s on a formula simplification that was a NOOP. DAG size: 90 [2019-11-16 00:24:08,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:08,028 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_338|, |v_#memory_$Pointer$.base_344|], 2=[|v_#memory_$Pointer$.offset_330|, |v_#memory_$Pointer$.offset_331|, |v_#memory_$Pointer$.base_332|, |v_#memory_$Pointer$.offset_332|, |v_#memory_$Pointer$.base_331|, |v_#memory_$Pointer$.base_330|]} [2019-11-16 00:24:09,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:09,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:09,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:09,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:10,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:10,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:10,682 INFO L235 Elim1Store]: Index analysis took 1737 ms [2019-11-16 00:24:13,091 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-16 00:24:13,091 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:24,191 WARN L191 SmtUtils]: Spent 11.10 s on a formula simplification that was a NOOP. DAG size: 87 [2019-11-16 00:24:24,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:24,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:24,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:24,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:24,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:25,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:25,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:26,110 INFO L235 Elim1Store]: Index analysis took 1679 ms [2019-11-16 00:24:27,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-16 00:24:27,821 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:32,394 WARN L191 SmtUtils]: Spent 4.57 s on a formula simplification that was a NOOP. DAG size: 84 [2019-11-16 00:24:32,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:32,428 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:35,259 WARN L191 SmtUtils]: Spent 2.83 s on a formula simplification that was a NOOP. DAG size: 80 [2019-11-16 00:24:35,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:35,294 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:36,879 WARN L191 SmtUtils]: Spent 1.58 s on a formula simplification that was a NOOP. DAG size: 76 [2019-11-16 00:24:36,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:36,900 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:37,952 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 72 [2019-11-16 00:24:37,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:37,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:38,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:38,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:38,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:38,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:38,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:38,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:38,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:38,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:38,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:38,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:38,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:38,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:38,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:38,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:38,184 INFO L235 Elim1Store]: Index analysis took 202 ms [2019-11-16 00:24:38,185 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-11-16 00:24:38,186 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:38,650 WARN L191 SmtUtils]: Spent 463.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-16 00:24:38,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:38,655 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:39,119 WARN L191 SmtUtils]: Spent 463.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-16 00:24:39,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:39,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:39,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:39,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:39,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:39,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:39,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:39,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:39,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:39,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:39,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:39,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:39,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:39,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:39,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:39,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:39,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-11-16 00:24:39,152 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:39,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:39,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:39,231 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 14 variables, input treesize:211, output treesize:91 [2019-11-16 00:24:39,268 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_339|], 12=[|v_#memory_$Pointer$.base_345|]} [2019-11-16 00:24:39,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:39,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:24:39,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:39,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:39,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:39,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:39,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:39,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:39,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:39,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:39,347 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 52 [2019-11-16 00:24:39,347 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:39,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:39,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:39,380 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-11-16 00:24:39,386 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_340|, |v_#memory_$Pointer$.base_333|, |v_#memory_$Pointer$.offset_333|, |v_#memory_$Pointer$.offset_334|], 6=[|v_#memory_$Pointer$.base_334|], 12=[|v_#memory_$Pointer$.base_346|]} [2019-11-16 00:24:39,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:39,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:24:39,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:40,071 WARN L191 SmtUtils]: Spent 515.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-16 00:24:40,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:40,076 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:40,414 WARN L191 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-16 00:24:40,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:40,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:40,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:24:40,471 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:40,635 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-16 00:24:40,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:40,654 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 59 treesize of output 41 [2019-11-16 00:24:40,654 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:40,799 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-16 00:24:40,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:40,803 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:40,989 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-16 00:24:40,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:41,191 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:24:41,192 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.downgradeDimensionsIfNecessary(ArrayOccurrenceAnalysis.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:200) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-16 00:24:41,196 INFO L168 Benchmark]: Toolchain (without parser) took 296875.97 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 274.7 MB). Free memory was 947.0 MB in the beginning and 814.9 MB in the end (delta: 132.1 MB). Peak memory consumption was 406.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:24:41,196 INFO L168 Benchmark]: CDTParser took 0.24 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-16 00:24:41,196 INFO L168 Benchmark]: CACSL2BoogieTranslator took 807.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -171.8 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:24:41,196 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:24:41,197 INFO L168 Benchmark]: Boogie Preprocessor took 96.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:24:41,197 INFO L168 Benchmark]: RCFGBuilder took 4051.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 89.5 MB). Peak memory consumption was 89.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:24:41,197 INFO L168 Benchmark]: TraceAbstraction took 291807.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 118.5 MB). Free memory was 1.0 GB in the beginning and 814.9 MB in the end (delta: 207.9 MB). Peak memory consumption was 326.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:24:41,199 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.24 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 807.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -171.8 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 109.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 96.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4051.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 89.5 MB). Peak memory consumption was 89.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 291807.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 118.5 MB). Free memory was 1.0 GB in the beginning and 814.9 MB in the end (delta: 207.9 MB). Peak memory consumption was 326.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...