./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/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 a1dfcb1c5c2cc6f52bdafead8c203cf19b170f34 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/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 a1dfcb1c5c2cc6f52bdafead8c203cf19b170f34 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: expected NNF --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:12:50,918 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:12:50,920 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:12:50,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:12:50,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:12:50,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:12:50,940 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:12:50,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:12:50,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:12:50,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:12:50,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:12:50,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:12:50,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:12:50,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:12:50,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:12:50,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:12:50,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:12:50,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:12:50,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:12:50,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:12:50,981 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:12:50,985 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:12:50,989 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:12:50,990 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:12:50,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:12:50,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:12:50,996 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:12:50,998 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:12:50,998 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:12:51,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:12:51,001 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:12:51,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:12:51,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:12:51,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:12:51,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:12:51,006 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:12:51,007 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:12:51,007 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:12:51,007 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:12:51,009 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:12:51,010 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:12:51,011 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:12:51,043 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:12:51,043 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:12:51,045 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:12:51,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:12:51,045 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:12:51,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:12:51,046 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:12:51,046 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:12:51,046 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:12:51,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:12:51,047 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:12:51,047 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:12:51,047 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:12:51,047 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:12:51,048 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:12:51,048 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:12:51,048 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:12:51,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:12:51,049 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:12:51,049 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:12:51,049 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:12:51,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:12:51,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:12:51,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:12:51,050 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:12:51,050 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:12:51,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:12:51,051 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:12:51,051 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_f3381148-a3b8-40a6-9023-696f8292f4f8/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 -> a1dfcb1c5c2cc6f52bdafead8c203cf19b170f34 [2019-11-15 21:12:51,101 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:12:51,113 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:12:51,116 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:12:51,118 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:12:51,118 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:12:51,119 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-1.c [2019-11-15 21:12:51,191 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/data/215acfe6c/efb8bbc627ce4888af838250576bc225/FLAGa7ac1339b [2019-11-15 21:12:51,731 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:12:51,733 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-1.c [2019-11-15 21:12:51,763 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/data/215acfe6c/efb8bbc627ce4888af838250576bc225/FLAGa7ac1339b [2019-11-15 21:12:51,929 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/data/215acfe6c/efb8bbc627ce4888af838250576bc225 [2019-11-15 21:12:51,931 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:12:51,933 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:12:51,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:12:51,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:12:51,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:12:51,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:12:51" (1/1) ... [2019-11-15 21:12:51,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21c03d99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:51, skipping insertion in model container [2019-11-15 21:12:51,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:12:51" (1/1) ... [2019-11-15 21:12:51,952 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:12:52,043 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:12:52,624 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:12:52,649 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:12:52,791 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:12:52,815 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:12:52,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:52 WrapperNode [2019-11-15 21:12:52,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:12:52,817 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:12:52,829 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:12:52,829 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:12:52,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:52" (1/1) ... [2019-11-15 21:12:52,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:52" (1/1) ... [2019-11-15 21:12:52,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:12:52,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:12:52,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:12:52,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:12:52,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:52" (1/1) ... [2019-11-15 21:12:52,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:52" (1/1) ... [2019-11-15 21:12:52,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:52" (1/1) ... [2019-11-15 21:12:52,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:52" (1/1) ... [2019-11-15 21:12:53,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:52" (1/1) ... [2019-11-15 21:12:53,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:52" (1/1) ... [2019-11-15 21:12:53,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:52" (1/1) ... [2019-11-15 21:12:53,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:12:53,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:12:53,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:12:53,036 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:12:53,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:12:53,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:12:53,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:12:53,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:12:53,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:12:53,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:12:53,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:12:53,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:12:53,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:12:53,439 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:12:54,618 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 21:12:54,618 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 21:12:54,619 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:12:54,619 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:12:54,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:12:54 BoogieIcfgContainer [2019-11-15 21:12:54,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:12:54,622 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:12:54,622 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:12:54,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:12:54,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:12:51" (1/3) ... [2019-11-15 21:12:54,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c06b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:12:54, skipping insertion in model container [2019-11-15 21:12:54,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:52" (2/3) ... [2019-11-15 21:12:54,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c06b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:12:54, skipping insertion in model container [2019-11-15 21:12:54,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:12:54" (3/3) ... [2019-11-15 21:12:54,629 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.08.i.cil-1.c [2019-11-15 21:12:54,640 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:12:54,648 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:12:54,660 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:12:54,688 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:12:54,688 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:12:54,688 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:12:54,688 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:12:54,689 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:12:54,689 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:12:54,689 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:12:54,689 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:12:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-11-15 21:12:54,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 21:12:54,723 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:54,724 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:12:54,726 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:12:54,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:54,732 INFO L82 PathProgramCache]: Analyzing trace with hash 62050801, now seen corresponding path program 1 times [2019-11-15 21:12:54,742 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:54,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831359223] [2019-11-15 21:12:54,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:54,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:54,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:55,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:55,121 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831359223] [2019-11-15 21:12:55,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:12:55,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:12:55,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982373475] [2019-11-15 21:12:55,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:12:55,132 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:55,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:12:55,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:12:55,153 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 4 states. [2019-11-15 21:12:55,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:55,812 INFO L93 Difference]: Finished difference Result 325 states and 551 transitions. [2019-11-15 21:12:55,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:12:55,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-11-15 21:12:55,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:12:55,847 INFO L225 Difference]: With dead ends: 325 [2019-11-15 21:12:55,850 INFO L226 Difference]: Without dead ends: 164 [2019-11-15 21:12:55,855 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:12:55,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-15 21:12:55,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2019-11-15 21:12:55,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-15 21:12:55,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 228 transitions. [2019-11-15 21:12:55,942 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 228 transitions. Word has length 43 [2019-11-15 21:12:55,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:12:55,943 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 228 transitions. [2019-11-15 21:12:55,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:12:55,944 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 228 transitions. [2019-11-15 21:12:55,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 21:12:55,953 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:55,954 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:12:55,954 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:12:55,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:55,955 INFO L82 PathProgramCache]: Analyzing trace with hash 96450622, now seen corresponding path program 1 times [2019-11-15 21:12:55,955 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:55,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681957200] [2019-11-15 21:12:55,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:55,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:55,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:56,184 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:56,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681957200] [2019-11-15 21:12:56,187 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:12:56,187 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:12:56,188 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920322898] [2019-11-15 21:12:56,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:12:56,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:56,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:12:56,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:12:56,192 INFO L87 Difference]: Start difference. First operand 147 states and 228 transitions. Second operand 4 states. [2019-11-15 21:12:56,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:56,781 INFO L93 Difference]: Finished difference Result 292 states and 447 transitions. [2019-11-15 21:12:56,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:12:56,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-15 21:12:56,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:12:56,784 INFO L225 Difference]: With dead ends: 292 [2019-11-15 21:12:56,785 INFO L226 Difference]: Without dead ends: 164 [2019-11-15 21:12:56,787 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:12:56,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-15 21:12:56,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2019-11-15 21:12:56,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-15 21:12:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 227 transitions. [2019-11-15 21:12:56,812 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 227 transitions. Word has length 56 [2019-11-15 21:12:56,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:12:56,813 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 227 transitions. [2019-11-15 21:12:56,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:12:56,813 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 227 transitions. [2019-11-15 21:12:56,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 21:12:56,822 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:56,822 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:12:56,823 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:12:56,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:56,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1230157520, now seen corresponding path program 1 times [2019-11-15 21:12:56,825 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:56,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532668170] [2019-11-15 21:12:56,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:56,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:56,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:56,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532668170] [2019-11-15 21:12:56,953 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:12:56,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:12:56,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361283340] [2019-11-15 21:12:56,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:12:56,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:56,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:12:56,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:12:56,955 INFO L87 Difference]: Start difference. First operand 147 states and 227 transitions. Second operand 4 states. [2019-11-15 21:12:57,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:57,364 INFO L93 Difference]: Finished difference Result 291 states and 445 transitions. [2019-11-15 21:12:57,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:12:57,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-15 21:12:57,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:12:57,368 INFO L225 Difference]: With dead ends: 291 [2019-11-15 21:12:57,369 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 21:12:57,370 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:12:57,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 21:12:57,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 147. [2019-11-15 21:12:57,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-15 21:12:57,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 226 transitions. [2019-11-15 21:12:57,391 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 226 transitions. Word has length 57 [2019-11-15 21:12:57,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:12:57,392 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 226 transitions. [2019-11-15 21:12:57,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:12:57,393 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 226 transitions. [2019-11-15 21:12:57,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 21:12:57,395 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:57,395 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:12:57,396 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:12:57,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:57,396 INFO L82 PathProgramCache]: Analyzing trace with hash 261723899, now seen corresponding path program 1 times [2019-11-15 21:12:57,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:57,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437485151] [2019-11-15 21:12:57,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:57,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:57,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:57,575 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:57,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437485151] [2019-11-15 21:12:57,577 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:12:57,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:12:57,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108565367] [2019-11-15 21:12:57,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:12:57,578 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:57,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:12:57,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:12:57,579 INFO L87 Difference]: Start difference. First operand 147 states and 226 transitions. Second operand 4 states. [2019-11-15 21:12:58,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:58,079 INFO L93 Difference]: Finished difference Result 289 states and 442 transitions. [2019-11-15 21:12:58,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:12:58,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-15 21:12:58,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:12:58,081 INFO L225 Difference]: With dead ends: 289 [2019-11-15 21:12:58,082 INFO L226 Difference]: Without dead ends: 161 [2019-11-15 21:12:58,083 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:12:58,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-15 21:12:58,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 147. [2019-11-15 21:12:58,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-15 21:12:58,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 225 transitions. [2019-11-15 21:12:58,107 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 225 transitions. Word has length 57 [2019-11-15 21:12:58,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:12:58,109 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 225 transitions. [2019-11-15 21:12:58,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:12:58,109 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 225 transitions. [2019-11-15 21:12:58,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 21:12:58,111 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:58,111 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:12:58,112 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:12:58,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:58,112 INFO L82 PathProgramCache]: Analyzing trace with hash -2030023109, now seen corresponding path program 1 times [2019-11-15 21:12:58,113 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:58,113 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893904808] [2019-11-15 21:12:58,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:58,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:58,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:58,237 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:58,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893904808] [2019-11-15 21:12:58,238 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:12:58,238 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:12:58,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172496660] [2019-11-15 21:12:58,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:12:58,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:58,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:12:58,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:12:58,240 INFO L87 Difference]: Start difference. First operand 147 states and 225 transitions. Second operand 4 states. [2019-11-15 21:12:58,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:58,665 INFO L93 Difference]: Finished difference Result 288 states and 440 transitions. [2019-11-15 21:12:58,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:12:58,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-15 21:12:58,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:12:58,668 INFO L225 Difference]: With dead ends: 288 [2019-11-15 21:12:58,668 INFO L226 Difference]: Without dead ends: 160 [2019-11-15 21:12:58,669 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:12:58,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-15 21:12:58,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 147. [2019-11-15 21:12:58,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-15 21:12:58,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 224 transitions. [2019-11-15 21:12:58,689 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 224 transitions. Word has length 57 [2019-11-15 21:12:58,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:12:58,690 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 224 transitions. [2019-11-15 21:12:58,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:12:58,690 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 224 transitions. [2019-11-15 21:12:58,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 21:12:58,691 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:58,691 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:12:58,692 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:12:58,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:58,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1177906332, now seen corresponding path program 1 times [2019-11-15 21:12:58,692 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:58,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014956623] [2019-11-15 21:12:58,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:58,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:58,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:58,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:58,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014956623] [2019-11-15 21:12:58,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:12:58,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:12:58,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832511566] [2019-11-15 21:12:58,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:12:58,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:58,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:12:58,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:12:58,791 INFO L87 Difference]: Start difference. First operand 147 states and 224 transitions. Second operand 4 states. [2019-11-15 21:12:59,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:59,193 INFO L93 Difference]: Finished difference Result 288 states and 439 transitions. [2019-11-15 21:12:59,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:12:59,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-15 21:12:59,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:12:59,197 INFO L225 Difference]: With dead ends: 288 [2019-11-15 21:12:59,198 INFO L226 Difference]: Without dead ends: 160 [2019-11-15 21:12:59,198 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:12:59,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-15 21:12:59,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 147. [2019-11-15 21:12:59,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-15 21:12:59,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 223 transitions. [2019-11-15 21:12:59,206 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 223 transitions. Word has length 57 [2019-11-15 21:12:59,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:12:59,206 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 223 transitions. [2019-11-15 21:12:59,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:12:59,206 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 223 transitions. [2019-11-15 21:12:59,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 21:12:59,207 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:59,207 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:12:59,208 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:12:59,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:59,208 INFO L82 PathProgramCache]: Analyzing trace with hash -36846841, now seen corresponding path program 1 times [2019-11-15 21:12:59,208 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:59,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439968478] [2019-11-15 21:12:59,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:59,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:59,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:59,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439968478] [2019-11-15 21:12:59,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:12:59,287 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:12:59,287 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543459174] [2019-11-15 21:12:59,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:12:59,288 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:59,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:12:59,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:12:59,290 INFO L87 Difference]: Start difference. First operand 147 states and 223 transitions. Second operand 4 states. [2019-11-15 21:12:59,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:59,700 INFO L93 Difference]: Finished difference Result 288 states and 438 transitions. [2019-11-15 21:12:59,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:12:59,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-15 21:12:59,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:12:59,703 INFO L225 Difference]: With dead ends: 288 [2019-11-15 21:12:59,703 INFO L226 Difference]: Without dead ends: 160 [2019-11-15 21:12:59,703 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:12:59,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-15 21:12:59,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 147. [2019-11-15 21:12:59,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-15 21:12:59,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 222 transitions. [2019-11-15 21:12:59,710 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 222 transitions. Word has length 58 [2019-11-15 21:12:59,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:12:59,710 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 222 transitions. [2019-11-15 21:12:59,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:12:59,711 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 222 transitions. [2019-11-15 21:12:59,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 21:12:59,711 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:12:59,712 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:12:59,713 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:12:59,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:59,713 INFO L82 PathProgramCache]: Analyzing trace with hash -2053945591, now seen corresponding path program 1 times [2019-11-15 21:12:59,713 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:59,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966609837] [2019-11-15 21:12:59,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:59,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:59,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:59,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:59,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966609837] [2019-11-15 21:12:59,783 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:12:59,784 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:12:59,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603836534] [2019-11-15 21:12:59,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:12:59,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:59,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:12:59,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:12:59,786 INFO L87 Difference]: Start difference. First operand 147 states and 222 transitions. Second operand 4 states. [2019-11-15 21:13:00,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:00,174 INFO L93 Difference]: Finished difference Result 288 states and 437 transitions. [2019-11-15 21:13:00,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:00,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 21:13:00,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:00,176 INFO L225 Difference]: With dead ends: 288 [2019-11-15 21:13:00,176 INFO L226 Difference]: Without dead ends: 160 [2019-11-15 21:13:00,176 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:00,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-15 21:13:00,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 147. [2019-11-15 21:13:00,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-15 21:13:00,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 221 transitions. [2019-11-15 21:13:00,182 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 221 transitions. Word has length 59 [2019-11-15 21:13:00,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:00,183 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 221 transitions. [2019-11-15 21:13:00,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:00,183 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 221 transitions. [2019-11-15 21:13:00,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 21:13:00,184 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:00,184 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:00,184 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:00,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:00,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1105265292, now seen corresponding path program 1 times [2019-11-15 21:13:00,185 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:00,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769767312] [2019-11-15 21:13:00,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:00,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:00,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:00,253 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:13:00,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769767312] [2019-11-15 21:13:00,254 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:00,254 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:00,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309065930] [2019-11-15 21:13:00,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:00,255 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:00,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:00,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:00,256 INFO L87 Difference]: Start difference. First operand 147 states and 221 transitions. Second operand 4 states. [2019-11-15 21:13:00,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:00,613 INFO L93 Difference]: Finished difference Result 278 states and 423 transitions. [2019-11-15 21:13:00,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:00,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-15 21:13:00,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:00,615 INFO L225 Difference]: With dead ends: 278 [2019-11-15 21:13:00,615 INFO L226 Difference]: Without dead ends: 150 [2019-11-15 21:13:00,616 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:00,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-15 21:13:00,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2019-11-15 21:13:00,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-15 21:13:00,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 220 transitions. [2019-11-15 21:13:00,622 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 220 transitions. Word has length 60 [2019-11-15 21:13:00,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:00,623 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 220 transitions. [2019-11-15 21:13:00,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:00,623 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 220 transitions. [2019-11-15 21:13:00,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 21:13:00,624 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:00,624 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:00,624 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:00,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:00,625 INFO L82 PathProgramCache]: Analyzing trace with hash 493391860, now seen corresponding path program 1 times [2019-11-15 21:13:00,625 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:00,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429538252] [2019-11-15 21:13:00,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:00,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:00,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:00,730 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:13:00,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429538252] [2019-11-15 21:13:00,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:00,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:00,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841669352] [2019-11-15 21:13:00,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:00,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:00,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:00,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:00,732 INFO L87 Difference]: Start difference. First operand 147 states and 220 transitions. Second operand 4 states. [2019-11-15 21:13:01,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:01,207 INFO L93 Difference]: Finished difference Result 318 states and 484 transitions. [2019-11-15 21:13:01,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:01,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-15 21:13:01,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:01,210 INFO L225 Difference]: With dead ends: 318 [2019-11-15 21:13:01,210 INFO L226 Difference]: Without dead ends: 190 [2019-11-15 21:13:01,210 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:01,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-15 21:13:01,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 169. [2019-11-15 21:13:01,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-15 21:13:01,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 258 transitions. [2019-11-15 21:13:01,220 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 258 transitions. Word has length 60 [2019-11-15 21:13:01,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:01,220 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 258 transitions. [2019-11-15 21:13:01,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:01,221 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 258 transitions. [2019-11-15 21:13:01,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 21:13:01,222 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:01,222 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:01,222 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:01,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:01,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1533548315, now seen corresponding path program 1 times [2019-11-15 21:13:01,223 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:01,223 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19860780] [2019-11-15 21:13:01,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:01,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:01,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:01,288 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:13:01,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19860780] [2019-11-15 21:13:01,289 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:01,290 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:01,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593081273] [2019-11-15 21:13:01,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:01,291 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:01,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:01,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:01,292 INFO L87 Difference]: Start difference. First operand 169 states and 258 transitions. Second operand 4 states. [2019-11-15 21:13:01,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:01,727 INFO L93 Difference]: Finished difference Result 340 states and 521 transitions. [2019-11-15 21:13:01,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:01,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-15 21:13:01,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:01,730 INFO L225 Difference]: With dead ends: 340 [2019-11-15 21:13:01,731 INFO L226 Difference]: Without dead ends: 190 [2019-11-15 21:13:01,731 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:01,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-15 21:13:01,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 169. [2019-11-15 21:13:01,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-15 21:13:01,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 257 transitions. [2019-11-15 21:13:01,743 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 257 transitions. Word has length 73 [2019-11-15 21:13:01,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:01,744 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 257 transitions. [2019-11-15 21:13:01,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:01,744 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 257 transitions. [2019-11-15 21:13:01,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 21:13:01,745 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:01,746 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:01,746 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:01,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:01,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1464454253, now seen corresponding path program 1 times [2019-11-15 21:13:01,746 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:01,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144404339] [2019-11-15 21:13:01,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:01,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:01,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:13:01,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144404339] [2019-11-15 21:13:01,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:01,837 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:01,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716143552] [2019-11-15 21:13:01,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:01,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:01,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:01,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:01,839 INFO L87 Difference]: Start difference. First operand 169 states and 257 transitions. Second operand 4 states. [2019-11-15 21:13:02,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:02,346 INFO L93 Difference]: Finished difference Result 339 states and 518 transitions. [2019-11-15 21:13:02,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:02,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-15 21:13:02,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:02,348 INFO L225 Difference]: With dead ends: 339 [2019-11-15 21:13:02,349 INFO L226 Difference]: Without dead ends: 189 [2019-11-15 21:13:02,349 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:02,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-15 21:13:02,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 169. [2019-11-15 21:13:02,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-15 21:13:02,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 256 transitions. [2019-11-15 21:13:02,357 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 256 transitions. Word has length 74 [2019-11-15 21:13:02,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:02,358 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 256 transitions. [2019-11-15 21:13:02,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:02,358 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 256 transitions. [2019-11-15 21:13:02,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 21:13:02,359 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:02,360 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:02,360 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:02,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:02,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1862079422, now seen corresponding path program 1 times [2019-11-15 21:13:02,361 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:02,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605943358] [2019-11-15 21:13:02,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:02,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:02,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:02,433 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:13:02,434 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605943358] [2019-11-15 21:13:02,434 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:02,434 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:02,434 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299199169] [2019-11-15 21:13:02,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:02,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:02,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:02,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:02,439 INFO L87 Difference]: Start difference. First operand 169 states and 256 transitions. Second operand 4 states. [2019-11-15 21:13:02,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:02,881 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2019-11-15 21:13:02,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:02,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-15 21:13:02,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:02,883 INFO L225 Difference]: With dead ends: 337 [2019-11-15 21:13:02,883 INFO L226 Difference]: Without dead ends: 187 [2019-11-15 21:13:02,884 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:02,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-15 21:13:02,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 169. [2019-11-15 21:13:02,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-15 21:13:02,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 255 transitions. [2019-11-15 21:13:02,892 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 255 transitions. Word has length 74 [2019-11-15 21:13:02,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:02,894 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 255 transitions. [2019-11-15 21:13:02,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:02,894 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 255 transitions. [2019-11-15 21:13:02,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 21:13:02,895 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:02,895 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:02,896 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:02,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:02,896 INFO L82 PathProgramCache]: Analyzing trace with hash -429667586, now seen corresponding path program 1 times [2019-11-15 21:13:02,897 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:02,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503916892] [2019-11-15 21:13:02,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:02,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:02,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:02,962 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:13:02,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503916892] [2019-11-15 21:13:02,967 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:02,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:02,968 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715198203] [2019-11-15 21:13:02,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:02,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:02,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:02,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:02,969 INFO L87 Difference]: Start difference. First operand 169 states and 255 transitions. Second operand 4 states. [2019-11-15 21:13:03,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:03,376 INFO L93 Difference]: Finished difference Result 336 states and 511 transitions. [2019-11-15 21:13:03,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:03,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-15 21:13:03,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:03,378 INFO L225 Difference]: With dead ends: 336 [2019-11-15 21:13:03,378 INFO L226 Difference]: Without dead ends: 186 [2019-11-15 21:13:03,379 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:03,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-15 21:13:03,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 169. [2019-11-15 21:13:03,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-15 21:13:03,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 254 transitions. [2019-11-15 21:13:03,385 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 254 transitions. Word has length 74 [2019-11-15 21:13:03,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:03,385 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 254 transitions. [2019-11-15 21:13:03,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:03,386 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 254 transitions. [2019-11-15 21:13:03,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 21:13:03,387 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:03,387 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:03,387 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:03,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:03,388 INFO L82 PathProgramCache]: Analyzing trace with hash 422449191, now seen corresponding path program 1 times [2019-11-15 21:13:03,388 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:03,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243775503] [2019-11-15 21:13:03,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:03,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:03,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:03,450 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:13:03,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243775503] [2019-11-15 21:13:03,450 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:03,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:03,451 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901623845] [2019-11-15 21:13:03,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:03,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:03,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:03,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:03,452 INFO L87 Difference]: Start difference. First operand 169 states and 254 transitions. Second operand 4 states. [2019-11-15 21:13:03,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:03,864 INFO L93 Difference]: Finished difference Result 336 states and 509 transitions. [2019-11-15 21:13:03,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:03,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-15 21:13:03,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:03,867 INFO L225 Difference]: With dead ends: 336 [2019-11-15 21:13:03,867 INFO L226 Difference]: Without dead ends: 186 [2019-11-15 21:13:03,868 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:03,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-15 21:13:03,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 169. [2019-11-15 21:13:03,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-15 21:13:03,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 253 transitions. [2019-11-15 21:13:03,875 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 253 transitions. Word has length 74 [2019-11-15 21:13:03,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:03,876 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 253 transitions. [2019-11-15 21:13:03,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:03,876 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 253 transitions. [2019-11-15 21:13:03,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 21:13:03,877 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:03,878 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:03,878 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:03,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:03,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1965433180, now seen corresponding path program 1 times [2019-11-15 21:13:03,879 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:03,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468753119] [2019-11-15 21:13:03,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:03,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:03,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:03,939 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:13:03,940 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468753119] [2019-11-15 21:13:03,942 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:03,942 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:03,943 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55331929] [2019-11-15 21:13:03,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:03,943 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:03,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:03,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:03,944 INFO L87 Difference]: Start difference. First operand 169 states and 253 transitions. Second operand 4 states. [2019-11-15 21:13:04,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:04,370 INFO L93 Difference]: Finished difference Result 336 states and 507 transitions. [2019-11-15 21:13:04,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:04,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-15 21:13:04,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:04,373 INFO L225 Difference]: With dead ends: 336 [2019-11-15 21:13:04,373 INFO L226 Difference]: Without dead ends: 186 [2019-11-15 21:13:04,373 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:04,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-15 21:13:04,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 169. [2019-11-15 21:13:04,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-15 21:13:04,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 252 transitions. [2019-11-15 21:13:04,382 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 252 transitions. Word has length 75 [2019-11-15 21:13:04,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:04,383 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 252 transitions. [2019-11-15 21:13:04,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:04,383 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 252 transitions. [2019-11-15 21:13:04,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 21:13:04,384 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:04,385 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:04,385 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:04,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:04,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1710579956, now seen corresponding path program 1 times [2019-11-15 21:13:04,386 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:04,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324899920] [2019-11-15 21:13:04,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:04,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:04,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:04,467 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:13:04,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324899920] [2019-11-15 21:13:04,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:04,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:04,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968597] [2019-11-15 21:13:04,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:04,469 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:04,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:04,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:04,469 INFO L87 Difference]: Start difference. First operand 169 states and 252 transitions. Second operand 4 states. [2019-11-15 21:13:04,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:04,864 INFO L93 Difference]: Finished difference Result 336 states and 505 transitions. [2019-11-15 21:13:04,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:04,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 21:13:04,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:04,866 INFO L225 Difference]: With dead ends: 336 [2019-11-15 21:13:04,866 INFO L226 Difference]: Without dead ends: 186 [2019-11-15 21:13:04,867 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:04,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-15 21:13:04,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 169. [2019-11-15 21:13:04,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-15 21:13:04,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 251 transitions. [2019-11-15 21:13:04,873 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 251 transitions. Word has length 76 [2019-11-15 21:13:04,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:04,873 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 251 transitions. [2019-11-15 21:13:04,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:04,874 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 251 transitions. [2019-11-15 21:13:04,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-15 21:13:04,875 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:04,875 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:04,876 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:04,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:04,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1135301911, now seen corresponding path program 1 times [2019-11-15 21:13:04,876 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:04,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769249907] [2019-11-15 21:13:04,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:04,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:04,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:04,944 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:13:04,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769249907] [2019-11-15 21:13:04,945 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:04,945 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:04,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043694038] [2019-11-15 21:13:04,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:04,946 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:04,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:04,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:04,947 INFO L87 Difference]: Start difference. First operand 169 states and 251 transitions. Second operand 4 states. [2019-11-15 21:13:05,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:05,331 INFO L93 Difference]: Finished difference Result 326 states and 490 transitions. [2019-11-15 21:13:05,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:05,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-15 21:13:05,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:05,333 INFO L225 Difference]: With dead ends: 326 [2019-11-15 21:13:05,334 INFO L226 Difference]: Without dead ends: 176 [2019-11-15 21:13:05,334 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:05,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-15 21:13:05,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 169. [2019-11-15 21:13:05,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-15 21:13:05,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 250 transitions. [2019-11-15 21:13:05,340 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 250 transitions. Word has length 77 [2019-11-15 21:13:05,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:05,340 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 250 transitions. [2019-11-15 21:13:05,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:05,341 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 250 transitions. [2019-11-15 21:13:05,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 21:13:05,342 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:05,343 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:05,343 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:05,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:05,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1507827117, now seen corresponding path program 1 times [2019-11-15 21:13:05,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:05,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118773266] [2019-11-15 21:13:05,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:05,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:05,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:05,437 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:13:05,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118773266] [2019-11-15 21:13:05,438 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:05,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:05,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179602881] [2019-11-15 21:13:05,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:05,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:05,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:05,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:05,446 INFO L87 Difference]: Start difference. First operand 169 states and 250 transitions. Second operand 4 states. [2019-11-15 21:13:06,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:06,022 INFO L93 Difference]: Finished difference Result 427 states and 645 transitions. [2019-11-15 21:13:06,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:06,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-15 21:13:06,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:06,027 INFO L225 Difference]: With dead ends: 427 [2019-11-15 21:13:06,027 INFO L226 Difference]: Without dead ends: 277 [2019-11-15 21:13:06,027 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:06,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-15 21:13:06,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 210. [2019-11-15 21:13:06,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-15 21:13:06,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 324 transitions. [2019-11-15 21:13:06,036 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 324 transitions. Word has length 82 [2019-11-15 21:13:06,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:06,036 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 324 transitions. [2019-11-15 21:13:06,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:06,037 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 324 transitions. [2019-11-15 21:13:06,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 21:13:06,038 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:06,039 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:06,039 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:06,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:06,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1931473839, now seen corresponding path program 1 times [2019-11-15 21:13:06,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:06,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360480674] [2019-11-15 21:13:06,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:06,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:06,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:13:06,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360480674] [2019-11-15 21:13:06,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:06,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:06,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262070705] [2019-11-15 21:13:06,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:06,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:06,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:06,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:06,122 INFO L87 Difference]: Start difference. First operand 210 states and 324 transitions. Second operand 4 states. [2019-11-15 21:13:06,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:06,644 INFO L93 Difference]: Finished difference Result 450 states and 701 transitions. [2019-11-15 21:13:06,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:06,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-15 21:13:06,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:06,648 INFO L225 Difference]: With dead ends: 450 [2019-11-15 21:13:06,648 INFO L226 Difference]: Without dead ends: 259 [2019-11-15 21:13:06,649 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:06,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-15 21:13:06,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 234. [2019-11-15 21:13:06,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 21:13:06,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 366 transitions. [2019-11-15 21:13:06,659 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 366 transitions. Word has length 82 [2019-11-15 21:13:06,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:06,659 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 366 transitions. [2019-11-15 21:13:06,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:06,660 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 366 transitions. [2019-11-15 21:13:06,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 21:13:06,661 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:06,662 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:06,662 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:06,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:06,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1813377491, now seen corresponding path program 1 times [2019-11-15 21:13:06,663 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:06,663 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288936161] [2019-11-15 21:13:06,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:06,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:06,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:06,824 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:13:06,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288936161] [2019-11-15 21:13:06,828 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:06,828 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:06,828 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102455365] [2019-11-15 21:13:06,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:06,829 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:06,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:06,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:06,831 INFO L87 Difference]: Start difference. First operand 234 states and 366 transitions. Second operand 4 states. [2019-11-15 21:13:07,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:07,402 INFO L93 Difference]: Finished difference Result 508 states and 791 transitions. [2019-11-15 21:13:07,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:07,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-11-15 21:13:07,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:07,408 INFO L225 Difference]: With dead ends: 508 [2019-11-15 21:13:07,408 INFO L226 Difference]: Without dead ends: 293 [2019-11-15 21:13:07,410 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:07,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-15 21:13:07,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 235. [2019-11-15 21:13:07,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-15 21:13:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 367 transitions. [2019-11-15 21:13:07,419 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 367 transitions. Word has length 83 [2019-11-15 21:13:07,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:07,420 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 367 transitions. [2019-11-15 21:13:07,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:07,420 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 367 transitions. [2019-11-15 21:13:07,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:13:07,422 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:07,422 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:07,423 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:07,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:07,423 INFO L82 PathProgramCache]: Analyzing trace with hash -724247038, now seen corresponding path program 1 times [2019-11-15 21:13:07,423 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:07,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28992967] [2019-11-15 21:13:07,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:07,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:07,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:07,547 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:13:07,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28992967] [2019-11-15 21:13:07,548 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:07,548 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:07,548 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057229768] [2019-11-15 21:13:07,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:07,549 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:07,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:07,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:07,550 INFO L87 Difference]: Start difference. First operand 235 states and 367 transitions. Second operand 4 states. [2019-11-15 21:13:08,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:08,142 INFO L93 Difference]: Finished difference Result 509 states and 791 transitions. [2019-11-15 21:13:08,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:08,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 21:13:08,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:08,148 INFO L225 Difference]: With dead ends: 509 [2019-11-15 21:13:08,148 INFO L226 Difference]: Without dead ends: 293 [2019-11-15 21:13:08,149 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:08,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-15 21:13:08,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 235. [2019-11-15 21:13:08,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-15 21:13:08,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 366 transitions. [2019-11-15 21:13:08,158 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 366 transitions. Word has length 95 [2019-11-15 21:13:08,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:08,158 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 366 transitions. [2019-11-15 21:13:08,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:08,159 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 366 transitions. [2019-11-15 21:13:08,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:13:08,160 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:08,160 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:08,161 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:08,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:08,161 INFO L82 PathProgramCache]: Analyzing trace with hash 151771968, now seen corresponding path program 1 times [2019-11-15 21:13:08,161 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:08,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011066028] [2019-11-15 21:13:08,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:08,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:08,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:08,238 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:13:08,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011066028] [2019-11-15 21:13:08,239 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:08,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:08,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720964722] [2019-11-15 21:13:08,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:08,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:08,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:08,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:08,242 INFO L87 Difference]: Start difference. First operand 235 states and 366 transitions. Second operand 4 states. [2019-11-15 21:13:08,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:08,714 INFO L93 Difference]: Finished difference Result 476 states and 742 transitions. [2019-11-15 21:13:08,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:08,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 21:13:08,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:08,718 INFO L225 Difference]: With dead ends: 476 [2019-11-15 21:13:08,718 INFO L226 Difference]: Without dead ends: 260 [2019-11-15 21:13:08,718 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:08,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-15 21:13:08,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 235. [2019-11-15 21:13:08,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-15 21:13:08,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 365 transitions. [2019-11-15 21:13:08,727 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 365 transitions. Word has length 95 [2019-11-15 21:13:08,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:08,727 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 365 transitions. [2019-11-15 21:13:08,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:08,728 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 365 transitions. [2019-11-15 21:13:08,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 21:13:08,729 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:08,729 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:08,730 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:08,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:08,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1558333836, now seen corresponding path program 1 times [2019-11-15 21:13:08,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:08,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064593545] [2019-11-15 21:13:08,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:08,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:08,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:08,813 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:13:08,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064593545] [2019-11-15 21:13:08,813 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:08,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:08,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243659427] [2019-11-15 21:13:08,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:08,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:08,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:08,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:08,816 INFO L87 Difference]: Start difference. First operand 235 states and 365 transitions. Second operand 4 states. [2019-11-15 21:13:09,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:09,397 INFO L93 Difference]: Finished difference Result 508 states and 786 transitions. [2019-11-15 21:13:09,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:09,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 21:13:09,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:09,401 INFO L225 Difference]: With dead ends: 508 [2019-11-15 21:13:09,401 INFO L226 Difference]: Without dead ends: 292 [2019-11-15 21:13:09,403 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:09,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-15 21:13:09,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 235. [2019-11-15 21:13:09,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-15 21:13:09,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 364 transitions. [2019-11-15 21:13:09,417 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 364 transitions. Word has length 96 [2019-11-15 21:13:09,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:09,418 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 364 transitions. [2019-11-15 21:13:09,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:09,418 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 364 transitions. [2019-11-15 21:13:09,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 21:13:09,420 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:09,420 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:09,420 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:09,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:09,421 INFO L82 PathProgramCache]: Analyzing trace with hash 589900215, now seen corresponding path program 1 times [2019-11-15 21:13:09,421 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:09,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039771260] [2019-11-15 21:13:09,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:09,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:09,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:09,501 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:13:09,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039771260] [2019-11-15 21:13:09,501 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:09,501 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:09,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029977605] [2019-11-15 21:13:09,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:09,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:09,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:09,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:09,503 INFO L87 Difference]: Start difference. First operand 235 states and 364 transitions. Second operand 4 states. [2019-11-15 21:13:10,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:10,103 INFO L93 Difference]: Finished difference Result 506 states and 782 transitions. [2019-11-15 21:13:10,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:10,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 21:13:10,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:10,106 INFO L225 Difference]: With dead ends: 506 [2019-11-15 21:13:10,107 INFO L226 Difference]: Without dead ends: 290 [2019-11-15 21:13:10,107 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:10,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-11-15 21:13:10,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 235. [2019-11-15 21:13:10,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-15 21:13:10,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 363 transitions. [2019-11-15 21:13:10,116 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 363 transitions. Word has length 96 [2019-11-15 21:13:10,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:10,116 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 363 transitions. [2019-11-15 21:13:10,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:10,117 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 363 transitions. [2019-11-15 21:13:10,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 21:13:10,118 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:10,118 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:10,118 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:10,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:10,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1701846793, now seen corresponding path program 1 times [2019-11-15 21:13:10,119 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:10,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60556025] [2019-11-15 21:13:10,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:10,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:10,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:10,206 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:13:10,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60556025] [2019-11-15 21:13:10,208 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:10,208 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:10,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6936121] [2019-11-15 21:13:10,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:10,209 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:10,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:10,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:10,210 INFO L87 Difference]: Start difference. First operand 235 states and 363 transitions. Second operand 4 states. [2019-11-15 21:13:10,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:10,795 INFO L93 Difference]: Finished difference Result 505 states and 779 transitions. [2019-11-15 21:13:10,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:10,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 21:13:10,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:10,798 INFO L225 Difference]: With dead ends: 505 [2019-11-15 21:13:10,798 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 21:13:10,798 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:10,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 21:13:10,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 235. [2019-11-15 21:13:10,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-15 21:13:10,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 362 transitions. [2019-11-15 21:13:10,808 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 362 transitions. Word has length 96 [2019-11-15 21:13:10,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:10,808 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 362 transitions. [2019-11-15 21:13:10,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:10,809 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 362 transitions. [2019-11-15 21:13:10,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 21:13:10,810 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:10,810 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:10,810 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:10,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:10,811 INFO L82 PathProgramCache]: Analyzing trace with hash -849730016, now seen corresponding path program 1 times [2019-11-15 21:13:10,811 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:10,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019933197] [2019-11-15 21:13:10,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:10,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:10,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:10,903 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 21:13:10,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019933197] [2019-11-15 21:13:10,905 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:10,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:13:10,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108379613] [2019-11-15 21:13:10,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:13:10,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:10,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:13:10,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:10,906 INFO L87 Difference]: Start difference. First operand 235 states and 362 transitions. Second operand 5 states. [2019-11-15 21:13:11,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:11,536 INFO L93 Difference]: Finished difference Result 472 states and 732 transitions. [2019-11-15 21:13:11,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:13:11,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-11-15 21:13:11,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:11,538 INFO L225 Difference]: With dead ends: 472 [2019-11-15 21:13:11,538 INFO L226 Difference]: Without dead ends: 256 [2019-11-15 21:13:11,539 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:13:11,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-15 21:13:11,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 255. [2019-11-15 21:13:11,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-15 21:13:11,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 388 transitions. [2019-11-15 21:13:11,548 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 388 transitions. Word has length 96 [2019-11-15 21:13:11,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:11,550 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 388 transitions. [2019-11-15 21:13:11,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:13:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 388 transitions. [2019-11-15 21:13:11,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 21:13:11,552 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:11,552 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:11,553 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:11,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:11,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1976685625, now seen corresponding path program 1 times [2019-11-15 21:13:11,553 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:11,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163772180] [2019-11-15 21:13:11,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:11,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:11,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:13:11,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163772180] [2019-11-15 21:13:11,624 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:11,625 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:11,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201151525] [2019-11-15 21:13:11,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:11,625 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:11,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:11,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:11,626 INFO L87 Difference]: Start difference. First operand 255 states and 388 transitions. Second operand 4 states. [2019-11-15 21:13:12,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:12,075 INFO L93 Difference]: Finished difference Result 513 states and 782 transitions. [2019-11-15 21:13:12,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:12,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 21:13:12,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:12,078 INFO L225 Difference]: With dead ends: 513 [2019-11-15 21:13:12,078 INFO L226 Difference]: Without dead ends: 277 [2019-11-15 21:13:12,079 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:12,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-15 21:13:12,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 255. [2019-11-15 21:13:12,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-15 21:13:12,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 387 transitions. [2019-11-15 21:13:12,088 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 387 transitions. Word has length 96 [2019-11-15 21:13:12,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:12,089 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 387 transitions. [2019-11-15 21:13:12,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:12,089 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 387 transitions. [2019-11-15 21:13:12,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 21:13:12,090 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:12,091 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:12,091 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:12,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:12,091 INFO L82 PathProgramCache]: Analyzing trace with hash -315061383, now seen corresponding path program 1 times [2019-11-15 21:13:12,092 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:12,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796613639] [2019-11-15 21:13:12,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:12,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:12,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:12,162 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:13:12,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796613639] [2019-11-15 21:13:12,162 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:12,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:12,163 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485191474] [2019-11-15 21:13:12,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:12,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:12,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:12,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:12,164 INFO L87 Difference]: Start difference. First operand 255 states and 387 transitions. Second operand 4 states. [2019-11-15 21:13:12,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:12,610 INFO L93 Difference]: Finished difference Result 512 states and 779 transitions. [2019-11-15 21:13:12,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:12,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 21:13:12,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:12,613 INFO L225 Difference]: With dead ends: 512 [2019-11-15 21:13:12,613 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 21:13:12,614 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:12,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 21:13:12,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 255. [2019-11-15 21:13:12,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-15 21:13:12,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 386 transitions. [2019-11-15 21:13:12,625 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 386 transitions. Word has length 96 [2019-11-15 21:13:12,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:12,626 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 386 transitions. [2019-11-15 21:13:12,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:12,626 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 386 transitions. [2019-11-15 21:13:12,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 21:13:12,628 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:12,628 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:12,629 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:12,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:12,629 INFO L82 PathProgramCache]: Analyzing trace with hash -2085923458, now seen corresponding path program 1 times [2019-11-15 21:13:12,629 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:12,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715604628] [2019-11-15 21:13:12,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:12,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:12,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:12,702 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:13:12,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715604628] [2019-11-15 21:13:12,703 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:12,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:12,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706561763] [2019-11-15 21:13:12,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:12,704 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:12,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:12,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:12,705 INFO L87 Difference]: Start difference. First operand 255 states and 386 transitions. Second operand 4 states. [2019-11-15 21:13:13,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:13,254 INFO L93 Difference]: Finished difference Result 545 states and 824 transitions. [2019-11-15 21:13:13,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:13,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 21:13:13,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:13,258 INFO L225 Difference]: With dead ends: 545 [2019-11-15 21:13:13,258 INFO L226 Difference]: Without dead ends: 309 [2019-11-15 21:13:13,258 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:13,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-15 21:13:13,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 255. [2019-11-15 21:13:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-15 21:13:13,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 385 transitions. [2019-11-15 21:13:13,268 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 385 transitions. Word has length 97 [2019-11-15 21:13:13,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:13,268 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 385 transitions. [2019-11-15 21:13:13,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:13,269 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 385 transitions. [2019-11-15 21:13:13,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 21:13:13,270 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:13,270 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:13,271 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:13,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:13,271 INFO L82 PathProgramCache]: Analyzing trace with hash -2045248708, now seen corresponding path program 1 times [2019-11-15 21:13:13,271 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:13,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070662453] [2019-11-15 21:13:13,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:13,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:13,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:13,341 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:13:13,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070662453] [2019-11-15 21:13:13,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:13,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:13,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118463324] [2019-11-15 21:13:13,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:13,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:13,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:13,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:13,344 INFO L87 Difference]: Start difference. First operand 255 states and 385 transitions. Second operand 4 states. [2019-11-15 21:13:13,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:13,797 INFO L93 Difference]: Finished difference Result 512 states and 775 transitions. [2019-11-15 21:13:13,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:13,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 21:13:13,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:13,800 INFO L225 Difference]: With dead ends: 512 [2019-11-15 21:13:13,800 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 21:13:13,801 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:13,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 21:13:13,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 255. [2019-11-15 21:13:13,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-15 21:13:13,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 384 transitions. [2019-11-15 21:13:13,810 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 384 transitions. Word has length 97 [2019-11-15 21:13:13,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:13,810 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 384 transitions. [2019-11-15 21:13:13,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:13,811 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 384 transitions. [2019-11-15 21:13:13,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 21:13:13,812 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:13,812 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:13,813 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:13,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:13,813 INFO L82 PathProgramCache]: Analyzing trace with hash -811521741, now seen corresponding path program 1 times [2019-11-15 21:13:13,814 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:13,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007532315] [2019-11-15 21:13:13,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:13,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:13,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:13,897 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:13:13,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007532315] [2019-11-15 21:13:13,898 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:13,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:13,898 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351198526] [2019-11-15 21:13:13,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:13,899 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:13,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:13,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:13,900 INFO L87 Difference]: Start difference. First operand 255 states and 384 transitions. Second operand 4 states. [2019-11-15 21:13:14,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:14,387 INFO L93 Difference]: Finished difference Result 545 states and 820 transitions. [2019-11-15 21:13:14,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:14,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 21:13:14,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:14,390 INFO L225 Difference]: With dead ends: 545 [2019-11-15 21:13:14,390 INFO L226 Difference]: Without dead ends: 309 [2019-11-15 21:13:14,391 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:14,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-15 21:13:14,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 255. [2019-11-15 21:13:14,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-15 21:13:14,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 383 transitions. [2019-11-15 21:13:14,404 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 383 transitions. Word has length 98 [2019-11-15 21:13:14,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:14,404 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 383 transitions. [2019-11-15 21:13:14,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:14,405 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 383 transitions. [2019-11-15 21:13:14,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 21:13:14,406 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:14,406 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:14,407 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:14,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:14,407 INFO L82 PathProgramCache]: Analyzing trace with hash 449395509, now seen corresponding path program 1 times [2019-11-15 21:13:14,407 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:14,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525188] [2019-11-15 21:13:14,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:14,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:14,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:14,494 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:13:14,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525188] [2019-11-15 21:13:14,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:14,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:14,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437255057] [2019-11-15 21:13:14,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:14,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:14,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:14,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:14,497 INFO L87 Difference]: Start difference. First operand 255 states and 383 transitions. Second operand 4 states. [2019-11-15 21:13:14,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:14,912 INFO L93 Difference]: Finished difference Result 512 states and 771 transitions. [2019-11-15 21:13:14,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:14,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 21:13:14,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:14,915 INFO L225 Difference]: With dead ends: 512 [2019-11-15 21:13:14,915 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 21:13:14,916 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:14,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 21:13:14,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 255. [2019-11-15 21:13:14,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-15 21:13:14,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 382 transitions. [2019-11-15 21:13:14,928 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 382 transitions. Word has length 98 [2019-11-15 21:13:14,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:14,929 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 382 transitions. [2019-11-15 21:13:14,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:14,929 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 382 transitions. [2019-11-15 21:13:14,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 21:13:14,931 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:14,931 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:14,932 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:14,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:14,932 INFO L82 PathProgramCache]: Analyzing trace with hash 593163641, now seen corresponding path program 1 times [2019-11-15 21:13:14,932 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:14,933 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594515543] [2019-11-15 21:13:14,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:14,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:14,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:15,009 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:13:15,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594515543] [2019-11-15 21:13:15,009 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:15,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:15,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314332765] [2019-11-15 21:13:15,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:15,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:15,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:15,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:15,011 INFO L87 Difference]: Start difference. First operand 255 states and 382 transitions. Second operand 4 states. [2019-11-15 21:13:15,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:15,600 INFO L93 Difference]: Finished difference Result 545 states and 816 transitions. [2019-11-15 21:13:15,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:15,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-15 21:13:15,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:15,604 INFO L225 Difference]: With dead ends: 545 [2019-11-15 21:13:15,604 INFO L226 Difference]: Without dead ends: 309 [2019-11-15 21:13:15,604 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:15,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-15 21:13:15,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 255. [2019-11-15 21:13:15,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-15 21:13:15,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 381 transitions. [2019-11-15 21:13:15,614 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 381 transitions. Word has length 99 [2019-11-15 21:13:15,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:15,614 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 381 transitions. [2019-11-15 21:13:15,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:15,615 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 381 transitions. [2019-11-15 21:13:15,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 21:13:15,616 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:15,616 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:15,616 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:15,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:15,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1026892727, now seen corresponding path program 1 times [2019-11-15 21:13:15,617 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:15,617 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310657995] [2019-11-15 21:13:15,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:15,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:15,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:13:15,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310657995] [2019-11-15 21:13:15,690 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:15,690 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:15,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948618970] [2019-11-15 21:13:15,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:15,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:15,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:15,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:15,692 INFO L87 Difference]: Start difference. First operand 255 states and 381 transitions. Second operand 4 states. [2019-11-15 21:13:16,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:16,078 INFO L93 Difference]: Finished difference Result 512 states and 767 transitions. [2019-11-15 21:13:16,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:16,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-15 21:13:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:16,080 INFO L225 Difference]: With dead ends: 512 [2019-11-15 21:13:16,081 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 21:13:16,081 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:16,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 21:13:16,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 255. [2019-11-15 21:13:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-15 21:13:16,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 380 transitions. [2019-11-15 21:13:16,093 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 380 transitions. Word has length 99 [2019-11-15 21:13:16,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:16,093 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 380 transitions. [2019-11-15 21:13:16,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:16,094 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 380 transitions. [2019-11-15 21:13:16,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 21:13:16,095 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:16,096 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:16,096 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:16,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:16,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1741675342, now seen corresponding path program 1 times [2019-11-15 21:13:16,097 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:16,097 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994587167] [2019-11-15 21:13:16,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:16,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:16,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:16,269 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:13:16,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994587167] [2019-11-15 21:13:16,270 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:16,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:16,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126169719] [2019-11-15 21:13:16,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:16,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:16,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:16,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:16,271 INFO L87 Difference]: Start difference. First operand 255 states and 380 transitions. Second operand 4 states. [2019-11-15 21:13:16,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:16,767 INFO L93 Difference]: Finished difference Result 535 states and 800 transitions. [2019-11-15 21:13:16,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:16,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-15 21:13:16,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:16,770 INFO L225 Difference]: With dead ends: 535 [2019-11-15 21:13:16,770 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 21:13:16,770 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:16,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 21:13:16,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 255. [2019-11-15 21:13:16,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-15 21:13:16,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 379 transitions. [2019-11-15 21:13:16,781 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 379 transitions. Word has length 100 [2019-11-15 21:13:16,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:16,781 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 379 transitions. [2019-11-15 21:13:16,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:16,781 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 379 transitions. [2019-11-15 21:13:16,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 21:13:16,783 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:16,783 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:16,783 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:16,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:16,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1992592176, now seen corresponding path program 1 times [2019-11-15 21:13:16,784 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:16,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095598414] [2019-11-15 21:13:16,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:16,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:16,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:16,864 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:13:16,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095598414] [2019-11-15 21:13:16,865 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:16,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:16,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613473403] [2019-11-15 21:13:16,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:16,867 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:16,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:16,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:16,867 INFO L87 Difference]: Start difference. First operand 255 states and 379 transitions. Second operand 4 states. [2019-11-15 21:13:17,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:17,234 INFO L93 Difference]: Finished difference Result 502 states and 751 transitions. [2019-11-15 21:13:17,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:17,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-15 21:13:17,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:17,236 INFO L225 Difference]: With dead ends: 502 [2019-11-15 21:13:17,237 INFO L226 Difference]: Without dead ends: 266 [2019-11-15 21:13:17,237 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:17,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-15 21:13:17,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 255. [2019-11-15 21:13:17,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-15 21:13:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 378 transitions. [2019-11-15 21:13:17,247 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 378 transitions. Word has length 100 [2019-11-15 21:13:17,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:17,247 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 378 transitions. [2019-11-15 21:13:17,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 378 transitions. [2019-11-15 21:13:17,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-15 21:13:17,249 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:17,250 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:17,250 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:17,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:17,250 INFO L82 PathProgramCache]: Analyzing trace with hash -368689638, now seen corresponding path program 1 times [2019-11-15 21:13:17,251 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:17,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250638946] [2019-11-15 21:13:17,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:17,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:17,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:17,328 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:13:17,328 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250638946] [2019-11-15 21:13:17,328 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:17,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:17,329 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519230070] [2019-11-15 21:13:17,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:17,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:17,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:17,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:17,330 INFO L87 Difference]: Start difference. First operand 255 states and 378 transitions. Second operand 4 states. [2019-11-15 21:13:17,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:17,788 INFO L93 Difference]: Finished difference Result 535 states and 796 transitions. [2019-11-15 21:13:17,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:17,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-15 21:13:17,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:17,791 INFO L225 Difference]: With dead ends: 535 [2019-11-15 21:13:17,791 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 21:13:17,792 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:17,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 21:13:17,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 255. [2019-11-15 21:13:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-15 21:13:17,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 377 transitions. [2019-11-15 21:13:17,804 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 377 transitions. Word has length 104 [2019-11-15 21:13:17,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:17,804 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 377 transitions. [2019-11-15 21:13:17,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:17,805 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 377 transitions. [2019-11-15 21:13:17,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-15 21:13:17,806 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:17,806 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:17,806 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:17,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:17,807 INFO L82 PathProgramCache]: Analyzing trace with hash -786086244, now seen corresponding path program 1 times [2019-11-15 21:13:17,807 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:17,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72566806] [2019-11-15 21:13:17,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:17,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:17,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:17,877 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 21:13:17,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72566806] [2019-11-15 21:13:17,877 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:17,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:13:17,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625861558] [2019-11-15 21:13:17,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:13:17,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:17,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:13:17,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:13:17,879 INFO L87 Difference]: Start difference. First operand 255 states and 377 transitions. Second operand 3 states. [2019-11-15 21:13:17,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:17,956 INFO L93 Difference]: Finished difference Result 725 states and 1086 transitions. [2019-11-15 21:13:17,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:13:17,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-15 21:13:17,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:17,960 INFO L225 Difference]: With dead ends: 725 [2019-11-15 21:13:17,960 INFO L226 Difference]: Without dead ends: 489 [2019-11-15 21:13:17,962 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:13:17,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-11-15 21:13:17,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2019-11-15 21:13:17,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-11-15 21:13:17,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 723 transitions. [2019-11-15 21:13:17,981 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 723 transitions. Word has length 104 [2019-11-15 21:13:17,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:17,981 INFO L462 AbstractCegarLoop]: Abstraction has 489 states and 723 transitions. [2019-11-15 21:13:17,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:13:17,981 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 723 transitions. [2019-11-15 21:13:17,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-15 21:13:17,983 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:17,983 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:17,984 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:17,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:17,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1514654609, now seen corresponding path program 1 times [2019-11-15 21:13:17,984 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:17,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715854079] [2019-11-15 21:13:17,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:17,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:17,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:18,065 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:13:18,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715854079] [2019-11-15 21:13:18,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:18,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:13:18,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724787395] [2019-11-15 21:13:18,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:13:18,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:18,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:13:18,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:13:18,067 INFO L87 Difference]: Start difference. First operand 489 states and 723 transitions. Second operand 3 states. [2019-11-15 21:13:18,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:18,156 INFO L93 Difference]: Finished difference Result 1193 states and 1778 transitions. [2019-11-15 21:13:18,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:13:18,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-15 21:13:18,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:18,161 INFO L225 Difference]: With dead ends: 1193 [2019-11-15 21:13:18,161 INFO L226 Difference]: Without dead ends: 723 [2019-11-15 21:13:18,162 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:13:18,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-11-15 21:13:18,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2019-11-15 21:13:18,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-11-15 21:13:18,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1070 transitions. [2019-11-15 21:13:18,237 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1070 transitions. Word has length 123 [2019-11-15 21:13:18,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:18,237 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 1070 transitions. [2019-11-15 21:13:18,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:13:18,238 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1070 transitions. [2019-11-15 21:13:18,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-15 21:13:18,240 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:18,240 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:18,241 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:18,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:18,241 INFO L82 PathProgramCache]: Analyzing trace with hash -933599837, now seen corresponding path program 1 times [2019-11-15 21:13:18,241 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:18,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940918226] [2019-11-15 21:13:18,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:18,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:18,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:18,368 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-15 21:13:18,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940918226] [2019-11-15 21:13:18,369 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:18,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:13:18,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753245224] [2019-11-15 21:13:18,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:13:18,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:18,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:13:18,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:13:18,371 INFO L87 Difference]: Start difference. First operand 723 states and 1070 transitions. Second operand 3 states. [2019-11-15 21:13:18,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:18,466 INFO L93 Difference]: Finished difference Result 1655 states and 2463 transitions. [2019-11-15 21:13:18,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:13:18,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-11-15 21:13:18,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:18,473 INFO L225 Difference]: With dead ends: 1655 [2019-11-15 21:13:18,473 INFO L226 Difference]: Without dead ends: 951 [2019-11-15 21:13:18,474 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:13:18,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-11-15 21:13:18,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 951. [2019-11-15 21:13:18,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-11-15 21:13:18,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1406 transitions. [2019-11-15 21:13:18,507 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1406 transitions. Word has length 166 [2019-11-15 21:13:18,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:18,508 INFO L462 AbstractCegarLoop]: Abstraction has 951 states and 1406 transitions. [2019-11-15 21:13:18,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:13:18,508 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1406 transitions. [2019-11-15 21:13:18,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-15 21:13:18,511 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:18,512 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:18,512 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:18,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:18,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1664913724, now seen corresponding path program 1 times [2019-11-15 21:13:18,513 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:18,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298131902] [2019-11-15 21:13:18,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:18,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:18,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-11-15 21:13:18,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298131902] [2019-11-15 21:13:18,621 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:18,621 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:13:18,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584335445] [2019-11-15 21:13:18,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:13:18,622 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:18,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:13:18,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:13:18,623 INFO L87 Difference]: Start difference. First operand 951 states and 1406 transitions. Second operand 3 states. [2019-11-15 21:13:18,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:18,720 INFO L93 Difference]: Finished difference Result 2117 states and 3144 transitions. [2019-11-15 21:13:18,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:13:18,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-11-15 21:13:18,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:18,727 INFO L225 Difference]: With dead ends: 2117 [2019-11-15 21:13:18,727 INFO L226 Difference]: Without dead ends: 1185 [2019-11-15 21:13:18,729 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:13:18,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-11-15 21:13:18,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1185. [2019-11-15 21:13:18,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-11-15 21:13:18,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1755 transitions. [2019-11-15 21:13:18,769 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1755 transitions. Word has length 205 [2019-11-15 21:13:18,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:18,769 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 1755 transitions. [2019-11-15 21:13:18,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:13:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1755 transitions. [2019-11-15 21:13:18,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-11-15 21:13:18,773 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:18,773 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:18,774 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:18,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:18,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1064030038, now seen corresponding path program 1 times [2019-11-15 21:13:18,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:18,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605508248] [2019-11-15 21:13:18,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:18,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:18,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:18,936 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2019-11-15 21:13:18,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605508248] [2019-11-15 21:13:18,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:18,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:13:18,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389892995] [2019-11-15 21:13:18,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:13:18,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:18,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:13:18,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:13:18,940 INFO L87 Difference]: Start difference. First operand 1185 states and 1755 transitions. Second operand 3 states. [2019-11-15 21:13:19,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:19,086 INFO L93 Difference]: Finished difference Result 2585 states and 3842 transitions. [2019-11-15 21:13:19,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:13:19,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2019-11-15 21:13:19,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:19,095 INFO L225 Difference]: With dead ends: 2585 [2019-11-15 21:13:19,095 INFO L226 Difference]: Without dead ends: 1419 [2019-11-15 21:13:19,098 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:13:19,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2019-11-15 21:13:19,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1419. [2019-11-15 21:13:19,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-11-15 21:13:19,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2105 transitions. [2019-11-15 21:13:19,151 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2105 transitions. Word has length 247 [2019-11-15 21:13:19,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:19,153 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 2105 transitions. [2019-11-15 21:13:19,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:13:19,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2105 transitions. [2019-11-15 21:13:19,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-11-15 21:13:19,158 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:19,159 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:19,159 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:19,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:19,160 INFO L82 PathProgramCache]: Analyzing trace with hash 2059484962, now seen corresponding path program 1 times [2019-11-15 21:13:19,160 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:19,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763366047] [2019-11-15 21:13:19,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:19,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:19,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:19,369 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2019-11-15 21:13:19,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763366047] [2019-11-15 21:13:19,370 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:19,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:19,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093496214] [2019-11-15 21:13:19,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:19,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:19,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:19,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:19,372 INFO L87 Difference]: Start difference. First operand 1419 states and 2105 transitions. Second operand 4 states. [2019-11-15 21:13:20,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:20,094 INFO L93 Difference]: Finished difference Result 3435 states and 5124 transitions. [2019-11-15 21:13:20,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:20,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 291 [2019-11-15 21:13:20,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:20,107 INFO L225 Difference]: With dead ends: 3435 [2019-11-15 21:13:20,108 INFO L226 Difference]: Without dead ends: 2035 [2019-11-15 21:13:20,110 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:20,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2019-11-15 21:13:20,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 1665. [2019-11-15 21:13:20,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1665 states. [2019-11-15 21:13:20,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2555 transitions. [2019-11-15 21:13:20,178 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2555 transitions. Word has length 291 [2019-11-15 21:13:20,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:20,179 INFO L462 AbstractCegarLoop]: Abstraction has 1665 states and 2555 transitions. [2019-11-15 21:13:20,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2555 transitions. [2019-11-15 21:13:20,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-11-15 21:13:20,185 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:20,185 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:20,186 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:20,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:20,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1624979364, now seen corresponding path program 1 times [2019-11-15 21:13:20,186 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:20,187 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87839298] [2019-11-15 21:13:20,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:20,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:20,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:20,368 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-11-15 21:13:20,368 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87839298] [2019-11-15 21:13:20,368 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:20,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:13:20,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689658753] [2019-11-15 21:13:20,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:13:20,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:20,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:13:20,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:13:20,370 INFO L87 Difference]: Start difference. First operand 1665 states and 2555 transitions. Second operand 3 states. [2019-11-15 21:13:20,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:20,492 INFO L93 Difference]: Finished difference Result 3581 states and 5510 transitions. [2019-11-15 21:13:20,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:13:20,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 291 [2019-11-15 21:13:20,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:20,505 INFO L225 Difference]: With dead ends: 3581 [2019-11-15 21:13:20,505 INFO L226 Difference]: Without dead ends: 1935 [2019-11-15 21:13:20,508 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:13:20,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-11-15 21:13:20,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-11-15 21:13:20,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-11-15 21:13:20,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2967 transitions. [2019-11-15 21:13:20,579 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2967 transitions. Word has length 291 [2019-11-15 21:13:20,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:20,580 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 2967 transitions. [2019-11-15 21:13:20,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:13:20,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2967 transitions. [2019-11-15 21:13:20,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-11-15 21:13:20,587 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:20,587 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2019-11-15 21:13:20,588 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:20,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:20,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1789083782, now seen corresponding path program 1 times [2019-11-15 21:13:20,589 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:20,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367301896] [2019-11-15 21:13:20,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:20,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:20,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-11-15 21:13:20,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367301896] [2019-11-15 21:13:20,803 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:20,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:13:20,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006599449] [2019-11-15 21:13:20,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:13:20,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:20,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:13:20,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:13:20,805 INFO L87 Difference]: Start difference. First operand 1935 states and 2967 transitions. Second operand 3 states. [2019-11-15 21:13:20,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:20,941 INFO L93 Difference]: Finished difference Result 4126 states and 6341 transitions. [2019-11-15 21:13:20,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:13:20,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-11-15 21:13:20,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:20,956 INFO L225 Difference]: With dead ends: 4126 [2019-11-15 21:13:20,956 INFO L226 Difference]: Without dead ends: 2210 [2019-11-15 21:13:20,960 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:13:20,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2019-11-15 21:13:21,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 2210. [2019-11-15 21:13:21,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2210 states. [2019-11-15 21:13:21,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2210 states to 2210 states and 3394 transitions. [2019-11-15 21:13:21,063 INFO L78 Accepts]: Start accepts. Automaton has 2210 states and 3394 transitions. Word has length 331 [2019-11-15 21:13:21,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:21,064 INFO L462 AbstractCegarLoop]: Abstraction has 2210 states and 3394 transitions. [2019-11-15 21:13:21,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:13:21,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2210 states and 3394 transitions. [2019-11-15 21:13:21,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-11-15 21:13:21,073 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:21,074 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:21,074 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:21,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:21,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1353737935, now seen corresponding path program 1 times [2019-11-15 21:13:21,075 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:21,075 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086846397] [2019-11-15 21:13:21,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:21,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:21,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:21,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 965 trivial. 0 not checked. [2019-11-15 21:13:21,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086846397] [2019-11-15 21:13:21,413 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:21,413 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:13:21,413 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388228979] [2019-11-15 21:13:21,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:13:21,414 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:21,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:13:21,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:13:21,415 INFO L87 Difference]: Start difference. First operand 2210 states and 3394 transitions. Second operand 3 states. [2019-11-15 21:13:21,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:21,527 INFO L93 Difference]: Finished difference Result 2487 states and 3824 transitions. [2019-11-15 21:13:21,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:13:21,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 374 [2019-11-15 21:13:21,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:21,543 INFO L225 Difference]: With dead ends: 2487 [2019-11-15 21:13:21,543 INFO L226 Difference]: Without dead ends: 2485 [2019-11-15 21:13:21,544 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:13:21,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2019-11-15 21:13:21,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2485. [2019-11-15 21:13:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2485 states. [2019-11-15 21:13:21,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2485 states and 3822 transitions. [2019-11-15 21:13:21,633 INFO L78 Accepts]: Start accepts. Automaton has 2485 states and 3822 transitions. Word has length 374 [2019-11-15 21:13:21,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:21,634 INFO L462 AbstractCegarLoop]: Abstraction has 2485 states and 3822 transitions. [2019-11-15 21:13:21,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:13:21,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 3822 transitions. [2019-11-15 21:13:21,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-11-15 21:13:21,643 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:21,643 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:21,643 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:21,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:21,644 INFO L82 PathProgramCache]: Analyzing trace with hash 573108616, now seen corresponding path program 1 times [2019-11-15 21:13:21,644 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:21,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921503279] [2019-11-15 21:13:21,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:21,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:21,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:22,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1565 backedges. 922 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2019-11-15 21:13:22,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921503279] [2019-11-15 21:13:22,250 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:22,250 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:13:22,250 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205109150] [2019-11-15 21:13:22,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:13:22,251 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:22,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:13:22,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:13:22,252 INFO L87 Difference]: Start difference. First operand 2485 states and 3822 transitions. Second operand 7 states. [2019-11-15 21:13:24,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:24,349 INFO L93 Difference]: Finished difference Result 8004 states and 12341 transitions. [2019-11-15 21:13:24,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:13:24,350 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 419 [2019-11-15 21:13:24,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:24,381 INFO L225 Difference]: With dead ends: 8004 [2019-11-15 21:13:24,382 INFO L226 Difference]: Without dead ends: 5538 [2019-11-15 21:13:24,386 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:13:24,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5538 states. [2019-11-15 21:13:24,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5538 to 4996. [2019-11-15 21:13:24,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4996 states. [2019-11-15 21:13:24,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4996 states to 4996 states and 7835 transitions. [2019-11-15 21:13:24,615 INFO L78 Accepts]: Start accepts. Automaton has 4996 states and 7835 transitions. Word has length 419 [2019-11-15 21:13:24,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:24,616 INFO L462 AbstractCegarLoop]: Abstraction has 4996 states and 7835 transitions. [2019-11-15 21:13:24,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:13:24,616 INFO L276 IsEmpty]: Start isEmpty. Operand 4996 states and 7835 transitions. [2019-11-15 21:13:24,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-11-15 21:13:24,630 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:24,632 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:24,632 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:24,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:24,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1618435896, now seen corresponding path program 1 times [2019-11-15 21:13:24,633 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:24,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722712991] [2019-11-15 21:13:24,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:24,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:24,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:25,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1565 backedges. 916 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-11-15 21:13:25,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722712991] [2019-11-15 21:13:25,147 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:25,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:13:25,148 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569546211] [2019-11-15 21:13:25,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:13:25,149 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:25,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:13:25,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:13:25,150 INFO L87 Difference]: Start difference. First operand 4996 states and 7835 transitions. Second operand 7 states. [2019-11-15 21:13:27,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:27,768 INFO L93 Difference]: Finished difference Result 17750 states and 27578 transitions. [2019-11-15 21:13:27,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:13:27,769 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 419 [2019-11-15 21:13:27,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:27,814 INFO L225 Difference]: With dead ends: 17750 [2019-11-15 21:13:27,814 INFO L226 Difference]: Without dead ends: 12773 [2019-11-15 21:13:27,824 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:13:27,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12773 states. [2019-11-15 21:13:28,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12773 to 7185. [2019-11-15 21:13:28,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7185 states. [2019-11-15 21:13:28,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7185 states to 7185 states and 11713 transitions. [2019-11-15 21:13:28,136 INFO L78 Accepts]: Start accepts. Automaton has 7185 states and 11713 transitions. Word has length 419 [2019-11-15 21:13:28,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:28,137 INFO L462 AbstractCegarLoop]: Abstraction has 7185 states and 11713 transitions. [2019-11-15 21:13:28,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:13:28,137 INFO L276 IsEmpty]: Start isEmpty. Operand 7185 states and 11713 transitions. [2019-11-15 21:13:28,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-11-15 21:13:28,160 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:28,160 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:28,160 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:28,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:28,161 INFO L82 PathProgramCache]: Analyzing trace with hash -177425532, now seen corresponding path program 1 times [2019-11-15 21:13:28,161 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:28,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296685623] [2019-11-15 21:13:28,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:28,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:28,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:28,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1572 backedges. 1008 proven. 0 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2019-11-15 21:13:28,539 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296685623] [2019-11-15 21:13:28,539 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:28,539 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:13:28,539 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519522682] [2019-11-15 21:13:28,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:28,540 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:28,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:28,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:28,541 INFO L87 Difference]: Start difference. First operand 7185 states and 11713 transitions. Second operand 4 states. [2019-11-15 21:13:29,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:29,204 INFO L93 Difference]: Finished difference Result 15487 states and 24889 transitions. [2019-11-15 21:13:29,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:29,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 421 [2019-11-15 21:13:29,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:29,223 INFO L225 Difference]: With dead ends: 15487 [2019-11-15 21:13:29,224 INFO L226 Difference]: Without dead ends: 8321 [2019-11-15 21:13:29,233 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:13:29,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8321 states. [2019-11-15 21:13:29,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8321 to 7203. [2019-11-15 21:13:29,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7203 states. [2019-11-15 21:13:29,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7203 states to 7203 states and 11731 transitions. [2019-11-15 21:13:29,482 INFO L78 Accepts]: Start accepts. Automaton has 7203 states and 11731 transitions. Word has length 421 [2019-11-15 21:13:29,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:29,483 INFO L462 AbstractCegarLoop]: Abstraction has 7203 states and 11731 transitions. [2019-11-15 21:13:29,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:29,483 INFO L276 IsEmpty]: Start isEmpty. Operand 7203 states and 11731 transitions. [2019-11-15 21:13:29,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-11-15 21:13:29,502 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:29,503 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:29,504 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:29,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:29,504 INFO L82 PathProgramCache]: Analyzing trace with hash -572426730, now seen corresponding path program 1 times [2019-11-15 21:13:29,504 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:29,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305506937] [2019-11-15 21:13:29,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:29,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:29,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:29,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1578 backedges. 925 proven. 0 refuted. 0 times theorem prover too weak. 653 trivial. 0 not checked. [2019-11-15 21:13:29,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305506937] [2019-11-15 21:13:29,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:29,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:13:29,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211972820] [2019-11-15 21:13:29,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:13:29,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:29,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:13:29,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:13:29,982 INFO L87 Difference]: Start difference. First operand 7203 states and 11731 transitions. Second operand 7 states. [2019-11-15 21:13:31,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:31,866 INFO L93 Difference]: Finished difference Result 16767 states and 26453 transitions. [2019-11-15 21:13:31,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:13:31,867 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 421 [2019-11-15 21:13:31,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:31,894 INFO L225 Difference]: With dead ends: 16767 [2019-11-15 21:13:31,894 INFO L226 Difference]: Without dead ends: 9583 [2019-11-15 21:13:31,904 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:13:31,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9583 states. [2019-11-15 21:13:32,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9583 to 5743. [2019-11-15 21:13:32,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5743 states. [2019-11-15 21:13:32,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5743 states to 5743 states and 9104 transitions. [2019-11-15 21:13:32,116 INFO L78 Accepts]: Start accepts. Automaton has 5743 states and 9104 transitions. Word has length 421 [2019-11-15 21:13:32,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:32,116 INFO L462 AbstractCegarLoop]: Abstraction has 5743 states and 9104 transitions. [2019-11-15 21:13:32,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:13:32,117 INFO L276 IsEmpty]: Start isEmpty. Operand 5743 states and 9104 transitions. [2019-11-15 21:13:32,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2019-11-15 21:13:32,127 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:32,130 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:32,130 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:32,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:32,131 INFO L82 PathProgramCache]: Analyzing trace with hash 695394340, now seen corresponding path program 1 times [2019-11-15 21:13:32,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:32,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362026171] [2019-11-15 21:13:32,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:32,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:32,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:32,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1814 backedges. 1146 proven. 92 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-11-15 21:13:32,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362026171] [2019-11-15 21:13:32,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904125267] [2019-11-15 21:13:32,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:13:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:32,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 1456 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:13:33,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:13:33,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-15 21:13:33,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:13:33,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:13:33,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:13:33,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 21:13:33,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2019-11-15 21:13:33,191 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:13:33,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:13:33,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 38 [2019-11-15 21:13:33,203 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:13:33,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:13:33,315 INFO L341 Elim1Store]: treesize reduction 59, result has 52.0 percent of original size [2019-11-15 21:13:33,315 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 73 [2019-11-15 21:13:33,316 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:13:33,386 INFO L567 ElimStorePlain]: treesize reduction 22, result has 69.9 percent of original size [2019-11-15 21:13:33,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:13:33,390 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:19 [2019-11-15 21:13:33,445 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 21:13:33,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 21:13:33,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:13:33,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:13:33,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:13:33,449 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 21:13:33,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1814 backedges. 1135 proven. 28 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2019-11-15 21:13:33,897 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:13:33,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-11-15 21:13:33,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050604882] [2019-11-15 21:13:33,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 21:13:33,900 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:13:33,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 21:13:33,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:13:33,900 INFO L87 Difference]: Start difference. First operand 5743 states and 9104 transitions. Second operand 11 states. [2019-11-15 21:13:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:37,281 INFO L93 Difference]: Finished difference Result 16657 states and 26206 transitions. [2019-11-15 21:13:37,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 21:13:37,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 445 [2019-11-15 21:13:37,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:37,302 INFO L225 Difference]: With dead ends: 16657 [2019-11-15 21:13:37,303 INFO L226 Difference]: Without dead ends: 10933 [2019-11-15 21:13:37,313 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 443 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-11-15 21:13:37,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10933 states. [2019-11-15 21:13:37,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10933 to 7435. [2019-11-15 21:13:37,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7435 states. [2019-11-15 21:13:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7435 states to 7435 states and 12200 transitions. [2019-11-15 21:13:37,607 INFO L78 Accepts]: Start accepts. Automaton has 7435 states and 12200 transitions. Word has length 445 [2019-11-15 21:13:37,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:37,607 INFO L462 AbstractCegarLoop]: Abstraction has 7435 states and 12200 transitions. [2019-11-15 21:13:37,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 21:13:37,608 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 12200 transitions. [2019-11-15 21:13:37,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2019-11-15 21:13:37,637 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:37,637 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:37,845 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:13:37,845 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:37,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:37,846 INFO L82 PathProgramCache]: Analyzing trace with hash 60458544, now seen corresponding path program 1 times [2019-11-15 21:13:37,846 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:37,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751933220] [2019-11-15 21:13:37,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:37,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:37,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:38,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1728 backedges. 1025 proven. 63 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2019-11-15 21:13:38,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751933220] [2019-11-15 21:13:38,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166024418] [2019-11-15 21:13:38,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:13:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:38,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 1462 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:13:38,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:13:38,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-15 21:13:38,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:13:38,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:13:38,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:13:38,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 21:13:38,835 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.offset_159|], 5=[|v_#memory_int_179|]} [2019-11-15 21:13:38,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 63 [2019-11-15 21:13:38,842 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:13:38,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:13:38,851 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2019-11-15 21:13:38,852 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:13:38,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:13:38,921 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:13:38,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 141 [2019-11-15 21:13:38,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:13:38,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:13:38,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:13:38,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:13:38,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:13:38,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:13:38,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:13:38,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:13:38,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:13:39,140 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:13:39,140 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 21:13:39,144 INFO L168 Benchmark]: Toolchain (without parser) took 47211.84 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 872.9 MB). Free memory was 940.7 MB in the beginning and 785.4 MB in the end (delta: 155.2 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-11-15 21:13:39,144 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:13:39,145 INFO L168 Benchmark]: CACSL2BoogieTranslator took 882.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -157.6 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:13:39,145 INFO L168 Benchmark]: Boogie Procedure Inliner took 126.90 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-15 21:13:39,145 INFO L168 Benchmark]: Boogie Preprocessor took 91.56 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: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:13:39,146 INFO L168 Benchmark]: RCFGBuilder took 1585.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 988.7 MB in the end (delta: 96.0 MB). Peak memory consumption was 96.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:13:39,146 INFO L168 Benchmark]: TraceAbstraction took 44521.08 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 743.4 MB). Free memory was 988.7 MB in the beginning and 785.4 MB in the end (delta: 203.3 MB). Peak memory consumption was 946.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:13:39,148 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 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 882.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -157.6 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 126.90 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 91.56 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: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1585.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 988.7 MB in the end (delta: 96.0 MB). Peak memory consumption was 96.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 44521.08 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 743.4 MB). Free memory was 988.7 MB in the beginning and 785.4 MB in the end (delta: 203.3 MB). Peak memory consumption was 946.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 21:13:41,583 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:13:41,585 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:13:41,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:13:41,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:13:41,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:13:41,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:13:41,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:13:41,626 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:13:41,629 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:13:41,632 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:13:41,634 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:13:41,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:13:41,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:13:41,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:13:41,640 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:13:41,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:13:41,644 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:13:41,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:13:41,651 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:13:41,655 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:13:41,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:13:41,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:13:41,663 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:13:41,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:13:41,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:13:41,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:13:41,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:13:41,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:13:41,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:13:41,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:13:41,674 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:13:41,675 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:13:41,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:13:41,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:13:41,678 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:13:41,679 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:13:41,679 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:13:41,679 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:13:41,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:13:41,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:13:41,683 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 21:13:41,718 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:13:41,730 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:13:41,731 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:13:41,731 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:13:41,732 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:13:41,732 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:13:41,732 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:13:41,732 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:13:41,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:13:41,733 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:13:41,733 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:13:41,733 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:13:41,734 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 21:13:41,734 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 21:13:41,734 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:13:41,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:13:41,735 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:13:41,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:13:41,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:13:41,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:13:41,736 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:13:41,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:13:41,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:13:41,737 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:13:41,737 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:13:41,737 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:13:41,737 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 21:13:41,738 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 21:13:41,739 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:13:41,739 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 21:13:41,739 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_f3381148-a3b8-40a6-9023-696f8292f4f8/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 -> a1dfcb1c5c2cc6f52bdafead8c203cf19b170f34 [2019-11-15 21:13:41,781 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:13:41,792 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:13:41,795 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:13:41,797 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:13:41,797 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:13:41,798 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-1.c [2019-11-15 21:13:41,870 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/data/49e9fcb76/e012044ee4be483b8ed0c5889a8038e0/FLAG2939e9024 [2019-11-15 21:13:42,498 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:13:42,498 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-1.c [2019-11-15 21:13:42,521 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/data/49e9fcb76/e012044ee4be483b8ed0c5889a8038e0/FLAG2939e9024 [2019-11-15 21:13:42,692 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/data/49e9fcb76/e012044ee4be483b8ed0c5889a8038e0 [2019-11-15 21:13:42,695 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:13:42,697 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:13:42,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:13:42,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:13:42,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:13:42,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:13:42" (1/1) ... [2019-11-15 21:13:42,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d3b7de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:13:42, skipping insertion in model container [2019-11-15 21:13:42,713 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:13:42" (1/1) ... [2019-11-15 21:13:42,721 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:13:42,809 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:13:43,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:13:43,438 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:13:43,591 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:13:43,615 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:13:43,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:13:43 WrapperNode [2019-11-15 21:13:43,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:13:43,617 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:13:43,617 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:13:43,618 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:13:43,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:13:43" (1/1) ... [2019-11-15 21:13:43,678 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:13:43" (1/1) ... [2019-11-15 21:13:43,750 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:13:43,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:13:43,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:13:43,759 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:13:43,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:13:43" (1/1) ... [2019-11-15 21:13:43,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:13:43" (1/1) ... [2019-11-15 21:13:43,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:13:43" (1/1) ... [2019-11-15 21:13:43,799 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:13:43" (1/1) ... [2019-11-15 21:13:43,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:13:43" (1/1) ... [2019-11-15 21:13:43,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:13:43" (1/1) ... [2019-11-15 21:13:43,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:13:43" (1/1) ... [2019-11-15 21:13:43,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:13:43,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:13:43,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:13:43,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:13:43,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:13:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:13:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:13:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:13:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 21:13:44,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:13:44,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:13:44,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:13:44,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:13:44,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 21:13:44,347 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:13:47,137 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 21:13:47,138 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 21:13:47,141 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:13:47,141 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:13:47,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:13:47 BoogieIcfgContainer [2019-11-15 21:13:47,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:13:47,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:13:47,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:13:47,149 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:13:47,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:13:42" (1/3) ... [2019-11-15 21:13:47,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381017b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:13:47, skipping insertion in model container [2019-11-15 21:13:47,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:13:43" (2/3) ... [2019-11-15 21:13:47,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381017b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:13:47, skipping insertion in model container [2019-11-15 21:13:47,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:13:47" (3/3) ... [2019-11-15 21:13:47,158 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.08.i.cil-1.c [2019-11-15 21:13:47,170 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:13:47,184 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:13:47,198 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:13:47,232 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:13:47,233 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:13:47,233 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:13:47,233 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:13:47,233 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:13:47,234 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:13:47,234 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:13:47,234 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:13:47,258 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-11-15 21:13:47,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 21:13:47,269 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:47,270 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:47,272 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:47,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:47,279 INFO L82 PathProgramCache]: Analyzing trace with hash 62050801, now seen corresponding path program 1 times [2019-11-15 21:13:47,293 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:13:47,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [996570141] [2019-11-15 21:13:47,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:13:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:47,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:13:47,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:13:47,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:13:47,633 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:13:47,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:13:47,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [996570141] [2019-11-15 21:13:47,675 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:47,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 21:13:47,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738198001] [2019-11-15 21:13:47,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:47,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:13:47,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:47,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:47,705 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 4 states. [2019-11-15 21:13:47,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:47,974 INFO L93 Difference]: Finished difference Result 564 states and 965 transitions. [2019-11-15 21:13:47,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:47,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-11-15 21:13:47,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:48,009 INFO L225 Difference]: With dead ends: 564 [2019-11-15 21:13:48,014 INFO L226 Difference]: Without dead ends: 384 [2019-11-15 21:13:48,019 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:48,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-11-15 21:13:48,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2019-11-15 21:13:48,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-15 21:13:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 586 transitions. [2019-11-15 21:13:48,160 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 586 transitions. Word has length 43 [2019-11-15 21:13:48,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:48,161 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 586 transitions. [2019-11-15 21:13:48,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:48,162 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 586 transitions. [2019-11-15 21:13:48,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-15 21:13:48,177 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:48,178 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:48,382 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:13:48,382 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:48,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:48,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1805197181, now seen corresponding path program 1 times [2019-11-15 21:13:48,384 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:13:48,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1945337532] [2019-11-15 21:13:48,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:13:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:48,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:13:48,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:13:48,717 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:13:48,718 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:13:48,751 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:13:48,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1945337532] [2019-11-15 21:13:48,752 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:48,753 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 21:13:48,753 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822115016] [2019-11-15 21:13:48,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:48,755 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:13:48,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:48,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:48,756 INFO L87 Difference]: Start difference. First operand 384 states and 586 transitions. Second operand 4 states. [2019-11-15 21:13:49,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:49,241 INFO L93 Difference]: Finished difference Result 881 states and 1360 transitions. [2019-11-15 21:13:49,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:49,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-15 21:13:49,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:49,247 INFO L225 Difference]: With dead ends: 881 [2019-11-15 21:13:49,248 INFO L226 Difference]: Without dead ends: 630 [2019-11-15 21:13:49,254 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:49,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-11-15 21:13:49,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-11-15 21:13:49,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-11-15 21:13:49,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 958 transitions. [2019-11-15 21:13:49,318 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 958 transitions. Word has length 105 [2019-11-15 21:13:49,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:49,320 INFO L462 AbstractCegarLoop]: Abstraction has 630 states and 958 transitions. [2019-11-15 21:13:49,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:49,324 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 958 transitions. [2019-11-15 21:13:49,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-15 21:13:49,335 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:49,335 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:49,538 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:13:49,539 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:49,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:49,540 INFO L82 PathProgramCache]: Analyzing trace with hash -928550483, now seen corresponding path program 1 times [2019-11-15 21:13:49,543 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:13:49,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1964833608] [2019-11-15 21:13:49,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:13:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:49,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:13:50,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:13:50,059 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-15 21:13:50,059 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:13:50,106 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-15 21:13:50,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1964833608] [2019-11-15 21:13:50,116 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:50,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 21:13:50,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663492296] [2019-11-15 21:13:50,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:13:50,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:13:50,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:13:50,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:13:50,120 INFO L87 Difference]: Start difference. First operand 630 states and 958 transitions. Second operand 3 states. [2019-11-15 21:13:51,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:51,395 INFO L93 Difference]: Finished difference Result 1249 states and 1909 transitions. [2019-11-15 21:13:51,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:13:51,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-11-15 21:13:51,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:51,402 INFO L225 Difference]: With dead ends: 1249 [2019-11-15 21:13:51,402 INFO L226 Difference]: Without dead ends: 752 [2019-11-15 21:13:51,404 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:13:51,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-11-15 21:13:51,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2019-11-15 21:13:51,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2019-11-15 21:13:51,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1140 transitions. [2019-11-15 21:13:51,440 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1140 transitions. Word has length 170 [2019-11-15 21:13:51,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:51,441 INFO L462 AbstractCegarLoop]: Abstraction has 752 states and 1140 transitions. [2019-11-15 21:13:51,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:13:51,441 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1140 transitions. [2019-11-15 21:13:51,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-15 21:13:51,445 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:51,446 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:51,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:13:51,649 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:51,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:51,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1909543535, now seen corresponding path program 1 times [2019-11-15 21:13:51,651 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:13:51,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [194528920] [2019-11-15 21:13:51,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:13:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:52,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:13:52,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:13:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-15 21:13:52,095 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:13:52,157 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-15 21:13:52,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [194528920] [2019-11-15 21:13:52,158 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:52,158 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 21:13:52,158 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563793562] [2019-11-15 21:13:52,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:52,160 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:13:52,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:52,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:52,160 INFO L87 Difference]: Start difference. First operand 752 states and 1140 transitions. Second operand 4 states. [2019-11-15 21:13:53,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:53,272 INFO L93 Difference]: Finished difference Result 1616 states and 2465 transitions. [2019-11-15 21:13:53,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:53,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2019-11-15 21:13:53,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:53,281 INFO L225 Difference]: With dead ends: 1616 [2019-11-15 21:13:53,281 INFO L226 Difference]: Without dead ends: 997 [2019-11-15 21:13:53,284 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:53,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-15 21:13:53,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2019-11-15 21:13:53,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-15 21:13:53,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1510 transitions. [2019-11-15 21:13:53,342 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1510 transitions. Word has length 211 [2019-11-15 21:13:53,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:53,344 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1510 transitions. [2019-11-15 21:13:53,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:53,345 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1510 transitions. [2019-11-15 21:13:53,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-11-15 21:13:53,351 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:53,352 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:53,555 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:13:53,555 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:53,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:53,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1032540037, now seen corresponding path program 1 times [2019-11-15 21:13:53,556 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:13:53,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [510868762] [2019-11-15 21:13:53,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:13:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:54,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:13:54,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:13:54,125 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-11-15 21:13:54,125 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:13:54,197 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-11-15 21:13:54,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [510868762] [2019-11-15 21:13:54,198 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:54,198 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 21:13:54,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872033573] [2019-11-15 21:13:54,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:13:54,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:13:54,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:13:54,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:13:54,201 INFO L87 Difference]: Start difference. First operand 997 states and 1510 transitions. Second operand 3 states. [2019-11-15 21:13:55,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:55,214 INFO L93 Difference]: Finished difference Result 1982 states and 3011 transitions. [2019-11-15 21:13:55,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:13:55,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-11-15 21:13:55,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:55,224 INFO L225 Difference]: With dead ends: 1982 [2019-11-15 21:13:55,224 INFO L226 Difference]: Without dead ends: 1118 [2019-11-15 21:13:55,227 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:13:55,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2019-11-15 21:13:55,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1118. [2019-11-15 21:13:55,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2019-11-15 21:13:55,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1690 transitions. [2019-11-15 21:13:55,281 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1690 transitions. Word has length 294 [2019-11-15 21:13:55,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:55,282 INFO L462 AbstractCegarLoop]: Abstraction has 1118 states and 1690 transitions. [2019-11-15 21:13:55,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:13:55,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1690 transitions. [2019-11-15 21:13:55,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-11-15 21:13:55,289 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:55,290 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2019-11-15 21:13:55,493 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:13:55,493 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:55,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:55,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1811855194, now seen corresponding path program 1 times [2019-11-15 21:13:55,494 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:13:55,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1104855084] [2019-11-15 21:13:55,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:13:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:55,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:13:55,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:13:56,049 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 652 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-11-15 21:13:56,049 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:13:56,149 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 652 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-11-15 21:13:56,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1104855084] [2019-11-15 21:13:56,150 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:13:56,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 21:13:56,150 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380722794] [2019-11-15 21:13:56,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:13:56,152 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:13:56,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:13:56,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:56,152 INFO L87 Difference]: Start difference. First operand 1118 states and 1690 transitions. Second operand 4 states. [2019-11-15 21:13:57,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:13:57,552 INFO L93 Difference]: Finished difference Result 2348 states and 3564 transitions. [2019-11-15 21:13:57,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:13:57,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2019-11-15 21:13:57,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:13:57,562 INFO L225 Difference]: With dead ends: 2348 [2019-11-15 21:13:57,562 INFO L226 Difference]: Without dead ends: 1363 [2019-11-15 21:13:57,564 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 662 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:13:57,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-11-15 21:13:57,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1363. [2019-11-15 21:13:57,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-15 21:13:57,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2058 transitions. [2019-11-15 21:13:57,628 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2058 transitions. Word has length 333 [2019-11-15 21:13:57,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:13:57,629 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 2058 transitions. [2019-11-15 21:13:57,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:13:57,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2058 transitions. [2019-11-15 21:13:57,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-11-15 21:13:57,639 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:13:57,640 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:57,843 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:13:57,844 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:13:57,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:57,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1696282884, now seen corresponding path program 1 times [2019-11-15 21:13:57,846 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:13:57,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [366710032] [2019-11-15 21:13:57,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3381148-a3b8-40a6-9023-696f8292f4f8/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:14:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:02,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-15 21:14:02,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:14:03,139 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:14:03,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-15 21:14:03,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:14:03,496 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-15 21:14:03,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:14:03,499 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_200|], 2=[|v_#memory_$Pointer$.base_196|, |v_#memory_$Pointer$.base_197|]} [2019-11-15 21:14:03,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:03,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:03,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:03,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:03,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:03,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:03,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 21:14:03,705 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:14:03,888 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-15 21:14:03,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:14:03,896 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:14:03,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:14:03,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:03,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:03,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:03,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:03,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:03,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:03,988 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 21:14:03,989 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:14:04,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:14:04,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:14:04,029 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:98, output treesize:56 [2019-11-15 21:14:04,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,107 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:14:04,107 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 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 21:14:04,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:14:04,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:14:04,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:14:04,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-15 21:14:04,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,173 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:14:04,173 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 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 21:14:04,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:14:04,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:14:04,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:14:04,206 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-15 21:14:04,213 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_198|], 12=[|v_#memory_$Pointer$.base_203|]} [2019-11-15 21:14:04,218 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:14:04,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:14:04,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,309 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:14:04,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 21:14:04,310 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:14:04,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:14:04,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:14:04,349 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:56 [2019-11-15 21:14:04,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,374 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:14:04,374 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 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 21:14:04,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:14:04,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:14:04,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:14:04,404 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-15 21:14:04,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,418 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:14:04,419 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 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 21:14:04,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:14:04,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:14:04,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:14:04,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-15 21:14:04,457 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_196|], 20=[|v_#memory_$Pointer$.base_206|]} [2019-11-15 21:14:04,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,468 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-15 21:14:04,469 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:14:04,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:14:04,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:04,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:05,185 WARN L191 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-11-15 21:14:05,186 INFO L341 Elim1Store]: treesize reduction 34, result has 84.6 percent of original size [2019-11-15 21:14:05,186 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2019-11-15 21:14:05,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:14:05,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:14:05,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:14:05,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:14:05,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:14:05,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:14:05,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:14:05,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:14:05,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:14:05,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:14:05,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:14:05,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:14:05,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:14:05,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:05,264 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 13 xjuncts. [2019-11-15 21:14:11,935 WARN L191 SmtUtils]: Spent 6.67 s on a formula simplification. DAG size of input: 111 DAG size of output: 37 [2019-11-15 21:14:11,936 INFO L567 ElimStorePlain]: treesize reduction 7170, result has 1.2 percent of original size [2019-11-15 21:14:11,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:14:11,937 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:83 [2019-11-15 21:14:12,010 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_199|], 30=[|v_#memory_$Pointer$.base_207|]} [2019-11-15 21:14:12,019 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:14:12,130 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-15 21:14:12,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:14:12,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:12,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:12,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:12,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:12,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:12,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:12,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:12,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:12,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:12,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:45,539 WARN L191 SmtUtils]: Spent 33.39 s on a formula simplification. DAG size of input: 98 DAG size of output: 98 [2019-11-15 21:14:45,540 INFO L341 Elim1Store]: treesize reduction 22, result has 92.6 percent of original size [2019-11-15 21:14:45,540 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 104 treesize of output 338 [2019-11-15 21:14:45,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:45,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:45,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:14:45,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:14:45,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:45,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:45,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:14:45,553 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:14:52,215 WARN L191 SmtUtils]: Spent 6.66 s on a formula simplification. DAG size of input: 130 DAG size of output: 40 [2019-11-15 21:14:52,215 INFO L567 ElimStorePlain]: treesize reduction 2195, result has 4.0 percent of original size [2019-11-15 21:14:52,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:14:52,216 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:121, output treesize:83 [2019-11-15 21:14:52,284 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_216|], 30=[|v_#memory_$Pointer$.base_208|]} [2019-11-15 21:14:52,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:14:52,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:14:52,442 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-15 21:14:52,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:14:52,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:52,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:52,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:52,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:52,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:14:52,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:15:08,981 WARN L191 SmtUtils]: Spent 16.52 s on a formula simplification that was a NOOP. DAG size: 85 [2019-11-15 21:15:08,982 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:15:08,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 263 [2019-11-15 21:15:08,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:08,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:08,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:08,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:08,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:08,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:08,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:08,994 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:15:09,493 WARN L191 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 42 [2019-11-15 21:15:09,494 INFO L567 ElimStorePlain]: treesize reduction 1122, result has 7.6 percent of original size [2019-11-15 21:15:09,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:15:09,495 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:115, output treesize:92 [2019-11-15 21:15:09,578 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_197|], 2=[|v_#memory_int_217|], 20=[|v_#memory_$Pointer$.base_209|]} [2019-11-15 21:15:09,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-11-15 21:15:09,594 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:15:09,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:15:09,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2019-11-15 21:15:09,678 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:15:09,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:15:09,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:15:09,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:15:09,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:15:09,922 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-15 21:15:09,923 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:15:09,923 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 147 [2019-11-15 21:15:09,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:09,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:15:10,001 INFO L496 ElimStorePlain]: Start of recursive call 4: 17 dim-0 vars, End of recursive call: 21 dim-0 vars, and 10 xjuncts. [2019-11-15 21:15:11,314 WARN L191 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 246 DAG size of output: 140 [2019-11-15 21:15:11,315 INFO L567 ElimStorePlain]: treesize reduction 512, result has 31.7 percent of original size [2019-11-15 21:15:11,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 20 dim-0 vars, and 1 xjuncts. [2019-11-15 21:15:11,319 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:123, output treesize:154 [2019-11-15 21:15:11,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:15:11,466 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-11-15 21:15:11,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:15:11,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:15:11,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:15:11,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2019-11-15 21:15:11,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-11-15 21:15:11,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:15:11,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:15:11,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:15:11,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-11-15 21:15:12,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1565 backedges. 884 proven. 96 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-11-15 21:15:12,389 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:15:12,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-11-15 21:15:12,460 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:15:12,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:15:12,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:15:12,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2019-11-15 21:15:12,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:15:12,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:15:12,740 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:15:12,741 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 21:15:12,746 INFO L168 Benchmark]: Toolchain (without parser) took 90048.72 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 425.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 257.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:15:12,746 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:15:12,747 INFO L168 Benchmark]: CACSL2BoogieTranslator took 916.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:15:12,747 INFO L168 Benchmark]: Boogie Procedure Inliner took 141.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:15:12,748 INFO L168 Benchmark]: Boogie Preprocessor took 164.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:15:12,748 INFO L168 Benchmark]: RCFGBuilder took 3220.88 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: 98.1 MB). Peak memory consumption was 98.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:15:12,749 INFO L168 Benchmark]: TraceAbstraction took 85598.73 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 265.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -93.4 MB). Peak memory consumption was 171.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:15:12,751 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.29 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 916.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 141.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 164.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3220.88 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: 98.1 MB). Peak memory consumption was 98.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 85598.73 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 265.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -93.4 MB). Peak memory consumption was 171.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...