./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_841d075a-29bb-45ae-a88c-3af313a23aa7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_841d075a-29bb-45ae-a88c-3af313a23aa7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_841d075a-29bb-45ae-a88c-3af313a23aa7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_841d075a-29bb-45ae-a88c-3af313a23aa7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_841d075a-29bb-45ae-a88c-3af313a23aa7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_841d075a-29bb-45ae-a88c-3af313a23aa7/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 99a77f5372e1d3174eb539425b8da52ff3b34c76 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:44:41,893 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:44:41,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:44:41,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:44:41,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:44:41,907 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:44:41,909 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:44:41,911 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:44:41,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:44:41,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:44:41,915 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:44:41,916 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:44:41,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:44:41,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:44:41,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:44:41,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:44:41,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:44:41,922 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:44:41,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:44:41,926 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:44:41,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:44:41,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:44:41,931 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:44:41,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:44:41,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:44:41,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:44:41,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:44:41,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:44:41,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:44:41,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:44:41,939 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:44:41,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:44:41,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:44:41,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:44:41,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:44:41,943 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:44:41,943 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:44:41,944 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:44:41,944 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:44:41,945 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:44:41,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:44:41,946 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_841d075a-29bb-45ae-a88c-3af313a23aa7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:44:41,961 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:44:41,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:44:41,963 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:44:41,963 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:44:41,964 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:44:41,964 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:44:41,964 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:44:41,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:44:41,965 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:44:41,965 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:44:41,965 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:44:41,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:44:41,966 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:44:41,966 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:44:41,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:44:41,966 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:44:41,966 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:44:41,967 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:44:41,967 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:44:41,967 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:44:41,967 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:44:41,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:44:41,968 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:44:41,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:44:41,968 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:44:41,969 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:44:41,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:44:41,969 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:44:41,969 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_841d075a-29bb-45ae-a88c-3af313a23aa7/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 -> 99a77f5372e1d3174eb539425b8da52ff3b34c76 [2019-11-15 21:44:41,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:44:42,010 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:44:42,016 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:44:42,019 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:44:42,020 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:44:42,021 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_841d075a-29bb-45ae-a88c-3af313a23aa7/bin/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2019-11-15 21:44:42,081 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_841d075a-29bb-45ae-a88c-3af313a23aa7/bin/uautomizer/data/488614b6b/c5f12f96d3b64c04807bb746264317d7/FLAG2d418cebe [2019-11-15 21:44:42,474 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:44:42,475 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_841d075a-29bb-45ae-a88c-3af313a23aa7/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2019-11-15 21:44:42,488 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_841d075a-29bb-45ae-a88c-3af313a23aa7/bin/uautomizer/data/488614b6b/c5f12f96d3b64c04807bb746264317d7/FLAG2d418cebe [2019-11-15 21:44:42,811 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_841d075a-29bb-45ae-a88c-3af313a23aa7/bin/uautomizer/data/488614b6b/c5f12f96d3b64c04807bb746264317d7 [2019-11-15 21:44:42,814 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:44:42,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:44:42,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:44:42,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:44:42,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:44:42,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:44:42" (1/1) ... [2019-11-15 21:44:42,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f8f4b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:42, skipping insertion in model container [2019-11-15 21:44:42,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:44:42" (1/1) ... [2019-11-15 21:44:42,838 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:44:42,911 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:44:43,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:44:43,338 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:44:43,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:44:43,432 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:44:43,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:43 WrapperNode [2019-11-15 21:44:43,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:44:43,433 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:44:43,433 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:44:43,433 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:44:43,441 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:44:43" (1/1) ... [2019-11-15 21:44:43,454 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:44:43" (1/1) ... [2019-11-15 21:44:43,540 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:44:43,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:44:43,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:44:43,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:44:43,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:43" (1/1) ... [2019-11-15 21:44:43,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:43" (1/1) ... [2019-11-15 21:44:43,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:43" (1/1) ... [2019-11-15 21:44:43,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:43" (1/1) ... [2019-11-15 21:44:43,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:43" (1/1) ... [2019-11-15 21:44:43,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:43" (1/1) ... [2019-11-15 21:44:43,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:43" (1/1) ... [2019-11-15 21:44:43,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:44:43,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:44:43,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:44:43,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:44:43,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_841d075a-29bb-45ae-a88c-3af313a23aa7/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:44:43,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:44:43,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:44:44,046 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:44:44,054 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:44:44,062 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:44:44,069 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:44:44,072 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:44:44,076 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:44:44,081 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:44:44,085 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:44:44,090 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:44:44,093 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:44:44,096 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:44:44,104 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:44:45,279 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2019-11-15 21:44:45,280 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2019-11-15 21:44:45,280 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2019-11-15 21:44:45,281 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2019-11-15 21:44:45,281 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##219: assume false; [2019-11-15 21:44:45,281 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##220: assume !false; [2019-11-15 21:44:45,281 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2019-11-15 21:44:45,283 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2019-11-15 21:44:45,284 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##322: assume !false; [2019-11-15 21:44:45,284 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##321: assume false; [2019-11-15 21:44:45,284 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-15 21:44:45,284 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-15 21:44:45,285 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2019-11-15 21:44:45,285 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2019-11-15 21:44:45,285 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume !false; [2019-11-15 21:44:45,285 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume false; [2019-11-15 21:44:45,285 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume false; [2019-11-15 21:44:45,286 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##141: assume !false; [2019-11-15 21:44:45,286 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##389: assume !false; [2019-11-15 21:44:45,286 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##388: assume false; [2019-11-15 21:44:45,286 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-11-15 21:44:45,286 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-11-15 21:44:45,287 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume !false; [2019-11-15 21:44:45,287 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##161: assume false; [2019-11-15 21:44:45,290 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:44:45,290 INFO L284 CfgBuilder]: Removed 154 assume(true) statements. [2019-11-15 21:44:45,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:44:45 BoogieIcfgContainer [2019-11-15 21:44:45,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:44:45,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:44:45,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:44:45,297 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:44:45,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:44:42" (1/3) ... [2019-11-15 21:44:45,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc3c78f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:44:45, skipping insertion in model container [2019-11-15 21:44:45,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:44:43" (2/3) ... [2019-11-15 21:44:45,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc3c78f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:44:45, skipping insertion in model container [2019-11-15 21:44:45,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:44:45" (3/3) ... [2019-11-15 21:44:45,303 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.c [2019-11-15 21:44:45,313 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:44:45,325 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. [2019-11-15 21:44:45,337 INFO L249 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2019-11-15 21:44:45,391 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:44:45,391 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:44:45,391 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:44:45,392 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:44:45,392 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:44:45,393 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:44:45,393 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:44:45,393 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:44:45,432 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states. [2019-11-15 21:44:45,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 21:44:45,443 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:45,444 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:44:45,447 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:45,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:45,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1766777508, now seen corresponding path program 1 times [2019-11-15 21:44:45,462 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:45,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858468160] [2019-11-15 21:44:45,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:45,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:45,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:45,648 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:44:45,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858468160] [2019-11-15 21:44:45,650 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:45,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:44:45,650 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997522565] [2019-11-15 21:44:45,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:44:45,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:45,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:44:45,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:44:45,672 INFO L87 Difference]: Start difference. First operand 330 states. Second operand 3 states. [2019-11-15 21:44:45,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:45,812 INFO L93 Difference]: Finished difference Result 578 states and 842 transitions. [2019-11-15 21:44:45,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:44:45,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-15 21:44:45,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:45,840 INFO L225 Difference]: With dead ends: 578 [2019-11-15 21:44:45,840 INFO L226 Difference]: Without dead ends: 324 [2019-11-15 21:44:45,846 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:44:45,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-11-15 21:44:45,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2019-11-15 21:44:45,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-11-15 21:44:45,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 442 transitions. [2019-11-15 21:44:45,923 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 442 transitions. Word has length 11 [2019-11-15 21:44:45,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:45,923 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 442 transitions. [2019-11-15 21:44:45,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:44:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 442 transitions. [2019-11-15 21:44:45,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 21:44:45,925 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:45,925 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:44:45,926 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:45,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:45,927 INFO L82 PathProgramCache]: Analyzing trace with hash 557701687, now seen corresponding path program 1 times [2019-11-15 21:44:45,927 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:45,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949750557] [2019-11-15 21:44:45,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:45,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:45,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:46,007 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:44:46,008 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949750557] [2019-11-15 21:44:46,008 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:46,008 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:44:46,009 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553492166] [2019-11-15 21:44:46,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:44:46,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:46,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:44:46,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:44:46,012 INFO L87 Difference]: Start difference. First operand 324 states and 442 transitions. Second operand 3 states. [2019-11-15 21:44:46,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:46,305 INFO L93 Difference]: Finished difference Result 433 states and 577 transitions. [2019-11-15 21:44:46,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:44:46,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-15 21:44:46,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:46,310 INFO L225 Difference]: With dead ends: 433 [2019-11-15 21:44:46,311 INFO L226 Difference]: Without dead ends: 368 [2019-11-15 21:44:46,312 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:44:46,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-11-15 21:44:46,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 351. [2019-11-15 21:44:46,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-11-15 21:44:46,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 479 transitions. [2019-11-15 21:44:46,368 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 479 transitions. Word has length 13 [2019-11-15 21:44:46,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:46,376 INFO L462 AbstractCegarLoop]: Abstraction has 351 states and 479 transitions. [2019-11-15 21:44:46,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:44:46,377 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 479 transitions. [2019-11-15 21:44:46,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 21:44:46,378 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:46,378 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:44:46,379 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:46,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:46,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1900748477, now seen corresponding path program 1 times [2019-11-15 21:44:46,380 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:46,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353966495] [2019-11-15 21:44:46,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:46,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:46,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:46,481 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:44:46,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353966495] [2019-11-15 21:44:46,481 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:46,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:44:46,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690314557] [2019-11-15 21:44:46,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:44:46,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:46,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:44:46,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:44:46,483 INFO L87 Difference]: Start difference. First operand 351 states and 479 transitions. Second operand 3 states. [2019-11-15 21:44:46,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:46,543 INFO L93 Difference]: Finished difference Result 554 states and 735 transitions. [2019-11-15 21:44:46,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:44:46,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-15 21:44:46,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:46,546 INFO L225 Difference]: With dead ends: 554 [2019-11-15 21:44:46,546 INFO L226 Difference]: Without dead ends: 362 [2019-11-15 21:44:46,548 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:44:46,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-11-15 21:44:46,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 307. [2019-11-15 21:44:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-11-15 21:44:46,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 421 transitions. [2019-11-15 21:44:46,571 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 421 transitions. Word has length 15 [2019-11-15 21:44:46,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:46,572 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 421 transitions. [2019-11-15 21:44:46,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:44:46,572 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 421 transitions. [2019-11-15 21:44:46,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 21:44:46,574 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:46,575 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] [2019-11-15 21:44:46,575 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:46,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:46,576 INFO L82 PathProgramCache]: Analyzing trace with hash 306593718, now seen corresponding path program 1 times [2019-11-15 21:44:46,576 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:46,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855140805] [2019-11-15 21:44:46,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:46,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:46,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:46,686 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:44:46,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855140805] [2019-11-15 21:44:46,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:46,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:44:46,688 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502657076] [2019-11-15 21:44:46,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:44:46,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:46,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:44:46,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:44:46,689 INFO L87 Difference]: Start difference. First operand 307 states and 421 transitions. Second operand 3 states. [2019-11-15 21:44:46,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:46,882 INFO L93 Difference]: Finished difference Result 307 states and 421 transitions. [2019-11-15 21:44:46,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:44:46,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-15 21:44:46,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:46,885 INFO L225 Difference]: With dead ends: 307 [2019-11-15 21:44:46,885 INFO L226 Difference]: Without dead ends: 293 [2019-11-15 21:44:46,886 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:44:46,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-15 21:44:46,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2019-11-15 21:44:46,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-11-15 21:44:46,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 407 transitions. [2019-11-15 21:44:46,932 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 407 transitions. Word has length 21 [2019-11-15 21:44:46,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:46,933 INFO L462 AbstractCegarLoop]: Abstraction has 293 states and 407 transitions. [2019-11-15 21:44:46,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:44:46,933 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 407 transitions. [2019-11-15 21:44:46,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 21:44:46,935 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:46,935 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] [2019-11-15 21:44:46,936 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:46,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:46,937 INFO L82 PathProgramCache]: Analyzing trace with hash 847063989, now seen corresponding path program 1 times [2019-11-15 21:44:46,937 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:46,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980340865] [2019-11-15 21:44:46,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:46,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:46,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:47,000 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:44:47,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980340865] [2019-11-15 21:44:47,001 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:47,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:44:47,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780768768] [2019-11-15 21:44:47,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:44:47,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:47,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:44:47,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:44:47,002 INFO L87 Difference]: Start difference. First operand 293 states and 407 transitions. Second operand 3 states. [2019-11-15 21:44:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:47,032 INFO L93 Difference]: Finished difference Result 304 states and 421 transitions. [2019-11-15 21:44:47,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:44:47,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-15 21:44:47,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:47,035 INFO L225 Difference]: With dead ends: 304 [2019-11-15 21:44:47,036 INFO L226 Difference]: Without dead ends: 288 [2019-11-15 21:44:47,036 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:44:47,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-15 21:44:47,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 264. [2019-11-15 21:44:47,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-11-15 21:44:47,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 376 transitions. [2019-11-15 21:44:47,053 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 376 transitions. Word has length 26 [2019-11-15 21:44:47,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:47,054 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 376 transitions. [2019-11-15 21:44:47,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:44:47,054 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 376 transitions. [2019-11-15 21:44:47,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 21:44:47,055 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:47,056 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] [2019-11-15 21:44:47,057 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:47,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:47,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1660315800, now seen corresponding path program 1 times [2019-11-15 21:44:47,057 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:47,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262249792] [2019-11-15 21:44:47,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:47,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:47,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:47,119 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:44:47,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262249792] [2019-11-15 21:44:47,119 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:47,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:44:47,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944006683] [2019-11-15 21:44:47,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:44:47,120 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:47,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:44:47,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:44:47,121 INFO L87 Difference]: Start difference. First operand 264 states and 376 transitions. Second operand 3 states. [2019-11-15 21:44:47,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:47,260 INFO L93 Difference]: Finished difference Result 307 states and 430 transitions. [2019-11-15 21:44:47,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:44:47,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-15 21:44:47,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:47,263 INFO L225 Difference]: With dead ends: 307 [2019-11-15 21:44:47,263 INFO L226 Difference]: Without dead ends: 261 [2019-11-15 21:44:47,263 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:44:47,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-15 21:44:47,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2019-11-15 21:44:47,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-15 21:44:47,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 372 transitions. [2019-11-15 21:44:47,280 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 372 transitions. Word has length 27 [2019-11-15 21:44:47,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:47,281 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 372 transitions. [2019-11-15 21:44:47,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:44:47,281 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 372 transitions. [2019-11-15 21:44:47,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 21:44:47,282 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:47,282 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] [2019-11-15 21:44:47,283 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:47,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:47,283 INFO L82 PathProgramCache]: Analyzing trace with hash -23036524, now seen corresponding path program 1 times [2019-11-15 21:44:47,284 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:47,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073083137] [2019-11-15 21:44:47,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:47,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:47,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:47,357 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:44:47,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073083137] [2019-11-15 21:44:47,357 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:47,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:44:47,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373750669] [2019-11-15 21:44:47,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:44:47,358 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:47,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:44:47,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:44:47,359 INFO L87 Difference]: Start difference. First operand 261 states and 372 transitions. Second operand 3 states. [2019-11-15 21:44:47,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:47,402 INFO L93 Difference]: Finished difference Result 325 states and 450 transitions. [2019-11-15 21:44:47,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:44:47,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-15 21:44:47,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:47,406 INFO L225 Difference]: With dead ends: 325 [2019-11-15 21:44:47,406 INFO L226 Difference]: Without dead ends: 275 [2019-11-15 21:44:47,407 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:44:47,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-15 21:44:47,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2019-11-15 21:44:47,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-15 21:44:47,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 371 transitions. [2019-11-15 21:44:47,424 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 371 transitions. Word has length 27 [2019-11-15 21:44:47,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:47,424 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 371 transitions. [2019-11-15 21:44:47,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:44:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 371 transitions. [2019-11-15 21:44:47,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 21:44:47,426 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:47,426 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] [2019-11-15 21:44:47,427 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:47,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:47,427 INFO L82 PathProgramCache]: Analyzing trace with hash 489558487, now seen corresponding path program 1 times [2019-11-15 21:44:47,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:47,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868232134] [2019-11-15 21:44:47,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:47,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:47,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:47,467 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:44:47,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868232134] [2019-11-15 21:44:47,467 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:47,467 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:44:47,467 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125620189] [2019-11-15 21:44:47,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:44:47,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:47,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:44:47,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:44:47,469 INFO L87 Difference]: Start difference. First operand 261 states and 371 transitions. Second operand 3 states. [2019-11-15 21:44:47,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:47,611 INFO L93 Difference]: Finished difference Result 276 states and 387 transitions. [2019-11-15 21:44:47,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:44:47,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-15 21:44:47,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:47,614 INFO L225 Difference]: With dead ends: 276 [2019-11-15 21:44:47,614 INFO L226 Difference]: Without dead ends: 249 [2019-11-15 21:44:47,614 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:44:47,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-11-15 21:44:47,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2019-11-15 21:44:47,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-11-15 21:44:47,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 347 transitions. [2019-11-15 21:44:47,629 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 347 transitions. Word has length 27 [2019-11-15 21:44:47,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:47,630 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 347 transitions. [2019-11-15 21:44:47,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:44:47,630 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 347 transitions. [2019-11-15 21:44:47,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 21:44:47,631 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:47,631 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] [2019-11-15 21:44:47,632 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:47,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:47,633 INFO L82 PathProgramCache]: Analyzing trace with hash 403678015, now seen corresponding path program 1 times [2019-11-15 21:44:47,633 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:47,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004181950] [2019-11-15 21:44:47,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:47,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:47,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:47,702 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:44:47,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004181950] [2019-11-15 21:44:47,703 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:47,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:44:47,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426482731] [2019-11-15 21:44:47,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:44:47,704 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:47,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:44:47,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:44:47,704 INFO L87 Difference]: Start difference. First operand 249 states and 347 transitions. Second operand 5 states. [2019-11-15 21:44:47,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:47,980 INFO L93 Difference]: Finished difference Result 410 states and 537 transitions. [2019-11-15 21:44:47,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:44:47,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-15 21:44:47,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:47,983 INFO L225 Difference]: With dead ends: 410 [2019-11-15 21:44:47,984 INFO L226 Difference]: Without dead ends: 359 [2019-11-15 21:44:47,984 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:44:47,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-11-15 21:44:48,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 284. [2019-11-15 21:44:48,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-11-15 21:44:48,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 399 transitions. [2019-11-15 21:44:48,002 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 399 transitions. Word has length 30 [2019-11-15 21:44:48,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:48,002 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 399 transitions. [2019-11-15 21:44:48,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:44:48,003 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 399 transitions. [2019-11-15 21:44:48,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 21:44:48,004 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:48,004 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] [2019-11-15 21:44:48,005 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:48,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:48,005 INFO L82 PathProgramCache]: Analyzing trace with hash 361661719, now seen corresponding path program 1 times [2019-11-15 21:44:48,005 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:48,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896629825] [2019-11-15 21:44:48,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:48,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:48,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:48,049 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:44:48,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896629825] [2019-11-15 21:44:48,049 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:48,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:44:48,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99133066] [2019-11-15 21:44:48,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:44:48,050 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:48,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:44:48,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:44:48,051 INFO L87 Difference]: Start difference. First operand 284 states and 399 transitions. Second operand 5 states. [2019-11-15 21:44:48,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:48,304 INFO L93 Difference]: Finished difference Result 341 states and 456 transitions. [2019-11-15 21:44:48,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:44:48,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-15 21:44:48,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:48,307 INFO L225 Difference]: With dead ends: 341 [2019-11-15 21:44:48,307 INFO L226 Difference]: Without dead ends: 315 [2019-11-15 21:44:48,308 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:44:48,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-15 21:44:48,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 271. [2019-11-15 21:44:48,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-11-15 21:44:48,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 381 transitions. [2019-11-15 21:44:48,323 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 381 transitions. Word has length 30 [2019-11-15 21:44:48,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:48,324 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 381 transitions. [2019-11-15 21:44:48,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:44:48,324 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 381 transitions. [2019-11-15 21:44:48,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 21:44:48,325 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:48,325 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] [2019-11-15 21:44:48,326 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:48,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:48,327 INFO L82 PathProgramCache]: Analyzing trace with hash -959450186, now seen corresponding path program 1 times [2019-11-15 21:44:48,327 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:48,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129304338] [2019-11-15 21:44:48,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:48,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:48,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:48,381 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:44:48,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129304338] [2019-11-15 21:44:48,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:48,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:44:48,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312578356] [2019-11-15 21:44:48,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:44:48,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:48,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:44:48,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:44:48,383 INFO L87 Difference]: Start difference. First operand 271 states and 381 transitions. Second operand 7 states. [2019-11-15 21:44:48,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:48,747 INFO L93 Difference]: Finished difference Result 304 states and 414 transitions. [2019-11-15 21:44:48,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:44:48,748 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-11-15 21:44:48,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:48,750 INFO L225 Difference]: With dead ends: 304 [2019-11-15 21:44:48,750 INFO L226 Difference]: Without dead ends: 241 [2019-11-15 21:44:48,751 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:44:48,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-15 21:44:48,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 219. [2019-11-15 21:44:48,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-15 21:44:48,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 307 transitions. [2019-11-15 21:44:48,795 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 307 transitions. Word has length 31 [2019-11-15 21:44:48,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:48,795 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 307 transitions. [2019-11-15 21:44:48,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:44:48,796 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 307 transitions. [2019-11-15 21:44:48,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 21:44:48,797 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:48,797 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] [2019-11-15 21:44:48,798 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:48,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:48,798 INFO L82 PathProgramCache]: Analyzing trace with hash -378484437, now seen corresponding path program 1 times [2019-11-15 21:44:48,798 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:48,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476292187] [2019-11-15 21:44:48,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:48,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:48,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:48,833 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:44:48,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476292187] [2019-11-15 21:44:48,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:48,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:44:48,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140230120] [2019-11-15 21:44:48,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:44:48,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:48,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:44:48,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:44:48,835 INFO L87 Difference]: Start difference. First operand 219 states and 307 transitions. Second operand 3 states. [2019-11-15 21:44:48,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:48,872 INFO L93 Difference]: Finished difference Result 435 states and 610 transitions. [2019-11-15 21:44:48,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:44:48,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-15 21:44:48,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:48,876 INFO L225 Difference]: With dead ends: 435 [2019-11-15 21:44:48,876 INFO L226 Difference]: Without dead ends: 431 [2019-11-15 21:44:48,876 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:44:48,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-11-15 21:44:48,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 269. [2019-11-15 21:44:48,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-11-15 21:44:48,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 371 transitions. [2019-11-15 21:44:48,895 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 371 transitions. Word has length 31 [2019-11-15 21:44:48,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:48,896 INFO L462 AbstractCegarLoop]: Abstraction has 269 states and 371 transitions. [2019-11-15 21:44:48,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:44:48,896 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 371 transitions. [2019-11-15 21:44:48,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 21:44:48,897 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:48,897 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] [2019-11-15 21:44:48,902 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:48,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:48,902 INFO L82 PathProgramCache]: Analyzing trace with hash -378424855, now seen corresponding path program 1 times [2019-11-15 21:44:48,903 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:48,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735242791] [2019-11-15 21:44:48,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:48,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:48,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:48,968 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:44:48,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735242791] [2019-11-15 21:44:48,969 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:48,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:44:48,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826228278] [2019-11-15 21:44:48,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:44:48,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:48,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:44:48,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:44:48,970 INFO L87 Difference]: Start difference. First operand 269 states and 371 transitions. Second operand 4 states. [2019-11-15 21:44:49,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:49,014 INFO L93 Difference]: Finished difference Result 315 states and 426 transitions. [2019-11-15 21:44:49,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:44:49,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-15 21:44:49,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:49,016 INFO L225 Difference]: With dead ends: 315 [2019-11-15 21:44:49,016 INFO L226 Difference]: Without dead ends: 257 [2019-11-15 21:44:49,017 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:44:49,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-11-15 21:44:49,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2019-11-15 21:44:49,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-15 21:44:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 353 transitions. [2019-11-15 21:44:49,034 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 353 transitions. Word has length 31 [2019-11-15 21:44:49,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:49,035 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 353 transitions. [2019-11-15 21:44:49,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:44:49,035 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 353 transitions. [2019-11-15 21:44:49,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 21:44:49,037 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:49,037 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] [2019-11-15 21:44:49,037 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:49,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:49,038 INFO L82 PathProgramCache]: Analyzing trace with hash -329006014, now seen corresponding path program 1 times [2019-11-15 21:44:49,038 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:49,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200097883] [2019-11-15 21:44:49,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:49,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:49,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:49,091 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:44:49,091 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200097883] [2019-11-15 21:44:49,091 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:49,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:44:49,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993039170] [2019-11-15 21:44:49,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:44:49,092 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:49,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:44:49,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:44:49,092 INFO L87 Difference]: Start difference. First operand 257 states and 353 transitions. Second operand 4 states. [2019-11-15 21:44:49,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:49,229 INFO L93 Difference]: Finished difference Result 291 states and 396 transitions. [2019-11-15 21:44:49,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:44:49,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-15 21:44:49,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:49,231 INFO L225 Difference]: With dead ends: 291 [2019-11-15 21:44:49,231 INFO L226 Difference]: Without dead ends: 245 [2019-11-15 21:44:49,232 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:44:49,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-15 21:44:49,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2019-11-15 21:44:49,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-15 21:44:49,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 337 transitions. [2019-11-15 21:44:49,251 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 337 transitions. Word has length 32 [2019-11-15 21:44:49,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:49,252 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 337 transitions. [2019-11-15 21:44:49,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:44:49,252 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 337 transitions. [2019-11-15 21:44:49,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 21:44:49,253 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:49,254 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] [2019-11-15 21:44:49,254 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:49,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:49,254 INFO L82 PathProgramCache]: Analyzing trace with hash -793600864, now seen corresponding path program 1 times [2019-11-15 21:44:49,255 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:49,255 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713132338] [2019-11-15 21:44:49,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:49,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:49,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:49,307 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:44:49,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713132338] [2019-11-15 21:44:49,308 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:49,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:44:49,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852114269] [2019-11-15 21:44:49,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:44:49,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:49,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:44:49,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:44:49,309 INFO L87 Difference]: Start difference. First operand 245 states and 337 transitions. Second operand 5 states. [2019-11-15 21:44:49,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:49,548 INFO L93 Difference]: Finished difference Result 276 states and 367 transitions. [2019-11-15 21:44:49,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:44:49,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-15 21:44:49,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:49,550 INFO L225 Difference]: With dead ends: 276 [2019-11-15 21:44:49,550 INFO L226 Difference]: Without dead ends: 271 [2019-11-15 21:44:49,552 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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:44:49,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-15 21:44:49,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 265. [2019-11-15 21:44:49,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-11-15 21:44:49,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 357 transitions. [2019-11-15 21:44:49,576 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 357 transitions. Word has length 32 [2019-11-15 21:44:49,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:49,576 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 357 transitions. [2019-11-15 21:44:49,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:44:49,576 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 357 transitions. [2019-11-15 21:44:49,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 21:44:49,577 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:49,577 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] [2019-11-15 21:44:49,577 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:49,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:49,578 INFO L82 PathProgramCache]: Analyzing trace with hash 778121725, now seen corresponding path program 1 times [2019-11-15 21:44:49,578 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:49,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532250950] [2019-11-15 21:44:49,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:49,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:49,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:49,614 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:44:49,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532250950] [2019-11-15 21:44:49,614 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:49,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:44:49,615 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326842093] [2019-11-15 21:44:49,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:44:49,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:49,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:44:49,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:44:49,616 INFO L87 Difference]: Start difference. First operand 265 states and 357 transitions. Second operand 4 states. [2019-11-15 21:44:49,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:49,749 INFO L93 Difference]: Finished difference Result 271 states and 362 transitions. [2019-11-15 21:44:49,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:44:49,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-15 21:44:49,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:49,752 INFO L225 Difference]: With dead ends: 271 [2019-11-15 21:44:49,752 INFO L226 Difference]: Without dead ends: 245 [2019-11-15 21:44:49,752 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:44:49,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-15 21:44:49,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2019-11-15 21:44:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-15 21:44:49,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 328 transitions. [2019-11-15 21:44:49,772 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 328 transitions. Word has length 33 [2019-11-15 21:44:49,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:49,773 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 328 transitions. [2019-11-15 21:44:49,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:44:49,773 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 328 transitions. [2019-11-15 21:44:49,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 21:44:49,774 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:49,774 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] [2019-11-15 21:44:49,775 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:49,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:49,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1781478438, now seen corresponding path program 1 times [2019-11-15 21:44:49,776 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:49,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745156380] [2019-11-15 21:44:49,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:49,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:49,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:49,814 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:44:49,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745156380] [2019-11-15 21:44:49,814 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:49,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:44:49,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90942292] [2019-11-15 21:44:49,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:44:49,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:49,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:44:49,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:44:49,815 INFO L87 Difference]: Start difference. First operand 245 states and 328 transitions. Second operand 3 states. [2019-11-15 21:44:49,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:49,912 INFO L93 Difference]: Finished difference Result 356 states and 458 transitions. [2019-11-15 21:44:49,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:44:49,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-15 21:44:49,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:49,914 INFO L225 Difference]: With dead ends: 356 [2019-11-15 21:44:49,914 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 21:44:49,915 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:44:49,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 21:44:49,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 247. [2019-11-15 21:44:49,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-11-15 21:44:49,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 330 transitions. [2019-11-15 21:44:49,935 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 330 transitions. Word has length 34 [2019-11-15 21:44:49,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:49,936 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 330 transitions. [2019-11-15 21:44:49,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:44:49,936 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 330 transitions. [2019-11-15 21:44:49,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 21:44:49,937 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:49,937 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] [2019-11-15 21:44:49,939 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:49,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:49,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1662125936, now seen corresponding path program 1 times [2019-11-15 21:44:49,940 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:49,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57924810] [2019-11-15 21:44:49,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:49,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:49,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:49,969 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:44:49,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57924810] [2019-11-15 21:44:49,970 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:49,970 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:44:49,970 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102604726] [2019-11-15 21:44:49,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:44:49,971 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:49,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:44:49,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:44:49,971 INFO L87 Difference]: Start difference. First operand 247 states and 330 transitions. Second operand 3 states. [2019-11-15 21:44:50,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:50,080 INFO L93 Difference]: Finished difference Result 263 states and 349 transitions. [2019-11-15 21:44:50,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:44:50,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-15 21:44:50,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:50,083 INFO L225 Difference]: With dead ends: 263 [2019-11-15 21:44:50,083 INFO L226 Difference]: Without dead ends: 259 [2019-11-15 21:44:50,083 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:44:50,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-15 21:44:50,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 251. [2019-11-15 21:44:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-15 21:44:50,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 333 transitions. [2019-11-15 21:44:50,103 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 333 transitions. Word has length 34 [2019-11-15 21:44:50,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:50,103 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 333 transitions. [2019-11-15 21:44:50,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:44:50,104 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 333 transitions. [2019-11-15 21:44:50,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 21:44:50,104 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:50,105 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] [2019-11-15 21:44:50,105 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:50,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:50,106 INFO L82 PathProgramCache]: Analyzing trace with hash -822248422, now seen corresponding path program 1 times [2019-11-15 21:44:50,106 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:50,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392821014] [2019-11-15 21:44:50,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:50,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:50,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:50,162 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:44:50,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392821014] [2019-11-15 21:44:50,162 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:50,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:44:50,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009032035] [2019-11-15 21:44:50,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:44:50,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:50,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:44:50,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:44:50,163 INFO L87 Difference]: Start difference. First operand 251 states and 333 transitions. Second operand 5 states. [2019-11-15 21:44:50,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:50,335 INFO L93 Difference]: Finished difference Result 304 states and 384 transitions. [2019-11-15 21:44:50,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:44:50,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-15 21:44:50,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:50,338 INFO L225 Difference]: With dead ends: 304 [2019-11-15 21:44:50,339 INFO L226 Difference]: Without dead ends: 300 [2019-11-15 21:44:50,339 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:44:50,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-15 21:44:50,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 251. [2019-11-15 21:44:50,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-15 21:44:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 331 transitions. [2019-11-15 21:44:50,364 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 331 transitions. Word has length 34 [2019-11-15 21:44:50,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:50,364 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 331 transitions. [2019-11-15 21:44:50,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:44:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 331 transitions. [2019-11-15 21:44:50,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 21:44:50,366 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:50,366 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] [2019-11-15 21:44:50,367 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:50,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:50,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1935189253, now seen corresponding path program 1 times [2019-11-15 21:44:50,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:50,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241068435] [2019-11-15 21:44:50,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:50,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:50,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:50,493 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:44:50,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241068435] [2019-11-15 21:44:50,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:50,494 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:44:50,494 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480936537] [2019-11-15 21:44:50,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:44:50,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:50,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:44:50,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:44:50,495 INFO L87 Difference]: Start difference. First operand 251 states and 331 transitions. Second operand 7 states. [2019-11-15 21:44:50,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:50,762 INFO L93 Difference]: Finished difference Result 269 states and 351 transitions. [2019-11-15 21:44:50,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:44:50,762 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-11-15 21:44:50,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:50,764 INFO L225 Difference]: With dead ends: 269 [2019-11-15 21:44:50,764 INFO L226 Difference]: Without dead ends: 250 [2019-11-15 21:44:50,765 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:44:50,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-11-15 21:44:50,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2019-11-15 21:44:50,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 21:44:50,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 329 transitions. [2019-11-15 21:44:50,787 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 329 transitions. Word has length 34 [2019-11-15 21:44:50,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:50,787 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 329 transitions. [2019-11-15 21:44:50,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:44:50,788 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 329 transitions. [2019-11-15 21:44:50,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 21:44:50,788 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:50,789 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] [2019-11-15 21:44:50,789 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:50,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:50,790 INFO L82 PathProgramCache]: Analyzing trace with hash -21362253, now seen corresponding path program 1 times [2019-11-15 21:44:50,790 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:50,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34703903] [2019-11-15 21:44:50,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:50,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:50,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:50,834 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:44:50,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34703903] [2019-11-15 21:44:50,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:50,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:44:50,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560456099] [2019-11-15 21:44:50,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:44:50,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:50,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:44:50,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:44:50,836 INFO L87 Difference]: Start difference. First operand 250 states and 329 transitions. Second operand 3 states. [2019-11-15 21:44:50,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:50,863 INFO L93 Difference]: Finished difference Result 268 states and 349 transitions. [2019-11-15 21:44:50,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:44:50,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-15 21:44:50,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:50,865 INFO L225 Difference]: With dead ends: 268 [2019-11-15 21:44:50,866 INFO L226 Difference]: Without dead ends: 231 [2019-11-15 21:44:50,866 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:44:50,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-11-15 21:44:50,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2019-11-15 21:44:50,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-15 21:44:50,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 303 transitions. [2019-11-15 21:44:50,884 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 303 transitions. Word has length 35 [2019-11-15 21:44:50,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:50,884 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 303 transitions. [2019-11-15 21:44:50,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:44:50,884 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 303 transitions. [2019-11-15 21:44:50,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 21:44:50,885 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:50,886 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] [2019-11-15 21:44:50,886 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:50,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:50,886 INFO L82 PathProgramCache]: Analyzing trace with hash 272561262, now seen corresponding path program 1 times [2019-11-15 21:44:50,887 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:50,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799016308] [2019-11-15 21:44:50,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:50,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:50,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:50,953 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:44:50,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799016308] [2019-11-15 21:44:50,954 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:50,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:44:50,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864481921] [2019-11-15 21:44:50,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:44:50,955 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:50,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:44:50,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:44:50,955 INFO L87 Difference]: Start difference. First operand 231 states and 303 transitions. Second operand 5 states. [2019-11-15 21:44:51,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:51,126 INFO L93 Difference]: Finished difference Result 289 states and 361 transitions. [2019-11-15 21:44:51,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:44:51,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-15 21:44:51,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:51,128 INFO L225 Difference]: With dead ends: 289 [2019-11-15 21:44:51,129 INFO L226 Difference]: Without dead ends: 258 [2019-11-15 21:44:51,129 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:44:51,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-15 21:44:51,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 231. [2019-11-15 21:44:51,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-15 21:44:51,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 297 transitions. [2019-11-15 21:44:51,148 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 297 transitions. Word has length 35 [2019-11-15 21:44:51,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:51,149 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 297 transitions. [2019-11-15 21:44:51,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:44:51,149 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 297 transitions. [2019-11-15 21:44:51,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 21:44:51,150 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:51,150 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] [2019-11-15 21:44:51,150 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:51,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:51,151 INFO L82 PathProgramCache]: Analyzing trace with hash -2102888975, now seen corresponding path program 1 times [2019-11-15 21:44:51,151 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:51,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596195252] [2019-11-15 21:44:51,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:51,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:51,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:51,201 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:44:51,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596195252] [2019-11-15 21:44:51,202 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:51,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:44:51,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550544095] [2019-11-15 21:44:51,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:44:51,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:51,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:44:51,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:44:51,203 INFO L87 Difference]: Start difference. First operand 231 states and 297 transitions. Second operand 7 states. [2019-11-15 21:44:51,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:51,466 INFO L93 Difference]: Finished difference Result 255 states and 321 transitions. [2019-11-15 21:44:51,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:44:51,467 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-11-15 21:44:51,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:51,468 INFO L225 Difference]: With dead ends: 255 [2019-11-15 21:44:51,468 INFO L226 Difference]: Without dead ends: 187 [2019-11-15 21:44:51,469 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:44:51,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-15 21:44:51,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 176. [2019-11-15 21:44:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-11-15 21:44:51,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 214 transitions. [2019-11-15 21:44:51,485 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 214 transitions. Word has length 35 [2019-11-15 21:44:51,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:51,485 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 214 transitions. [2019-11-15 21:44:51,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:44:51,485 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 214 transitions. [2019-11-15 21:44:51,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 21:44:51,486 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:51,486 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] [2019-11-15 21:44:51,487 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:51,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:51,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1804254012, now seen corresponding path program 1 times [2019-11-15 21:44:51,487 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:51,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226446113] [2019-11-15 21:44:51,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:51,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:51,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:51,573 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:44:51,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226446113] [2019-11-15 21:44:51,574 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:51,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:44:51,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760046572] [2019-11-15 21:44:51,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:44:51,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:51,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:44:51,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:44:51,575 INFO L87 Difference]: Start difference. First operand 176 states and 214 transitions. Second operand 6 states. [2019-11-15 21:44:51,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:51,739 INFO L93 Difference]: Finished difference Result 187 states and 225 transitions. [2019-11-15 21:44:51,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:44:51,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-11-15 21:44:51,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:51,741 INFO L225 Difference]: With dead ends: 187 [2019-11-15 21:44:51,741 INFO L226 Difference]: Without dead ends: 155 [2019-11-15 21:44:51,742 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:44:51,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-15 21:44:51,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-15 21:44:51,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-15 21:44:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 184 transitions. [2019-11-15 21:44:51,757 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 184 transitions. Word has length 35 [2019-11-15 21:44:51,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:51,758 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 184 transitions. [2019-11-15 21:44:51,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:44:51,758 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 184 transitions. [2019-11-15 21:44:51,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 21:44:51,759 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:51,759 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] [2019-11-15 21:44:51,759 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:51,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:51,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1398430965, now seen corresponding path program 1 times [2019-11-15 21:44:51,760 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:51,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674805631] [2019-11-15 21:44:51,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:51,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:51,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:51,827 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:44:51,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674805631] [2019-11-15 21:44:51,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:51,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:44:51,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680854638] [2019-11-15 21:44:51,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:44:51,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:51,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:44:51,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:44:51,828 INFO L87 Difference]: Start difference. First operand 155 states and 184 transitions. Second operand 7 states. [2019-11-15 21:44:52,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:52,030 INFO L93 Difference]: Finished difference Result 193 states and 224 transitions. [2019-11-15 21:44:52,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:44:52,030 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-11-15 21:44:52,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:52,032 INFO L225 Difference]: With dead ends: 193 [2019-11-15 21:44:52,032 INFO L226 Difference]: Without dead ends: 173 [2019-11-15 21:44:52,032 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:44:52,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-15 21:44:52,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 154. [2019-11-15 21:44:52,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-15 21:44:52,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 182 transitions. [2019-11-15 21:44:52,046 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 182 transitions. Word has length 36 [2019-11-15 21:44:52,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:52,047 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 182 transitions. [2019-11-15 21:44:52,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:44:52,047 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 182 transitions. [2019-11-15 21:44:52,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 21:44:52,048 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:52,048 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] [2019-11-15 21:44:52,048 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:52,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:52,049 INFO L82 PathProgramCache]: Analyzing trace with hash 287352256, now seen corresponding path program 1 times [2019-11-15 21:44:52,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:52,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864438676] [2019-11-15 21:44:52,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:52,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:52,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:44:52,116 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:44:52,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864438676] [2019-11-15 21:44:52,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:44:52,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:44:52,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052221596] [2019-11-15 21:44:52,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:44:52,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:44:52,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:44:52,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:44:52,119 INFO L87 Difference]: Start difference. First operand 154 states and 182 transitions. Second operand 6 states. [2019-11-15 21:44:52,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:44:52,314 INFO L93 Difference]: Finished difference Result 197 states and 224 transitions. [2019-11-15 21:44:52,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:44:52,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-11-15 21:44:52,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:44:52,316 INFO L225 Difference]: With dead ends: 197 [2019-11-15 21:44:52,316 INFO L226 Difference]: Without dead ends: 192 [2019-11-15 21:44:52,316 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:44:52,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-15 21:44:52,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 167. [2019-11-15 21:44:52,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-15 21:44:52,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 195 transitions. [2019-11-15 21:44:52,340 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 195 transitions. Word has length 37 [2019-11-15 21:44:52,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:44:52,341 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 195 transitions. [2019-11-15 21:44:52,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:44:52,341 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 195 transitions. [2019-11-15 21:44:52,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 21:44:52,342 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:44:52,342 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] [2019-11-15 21:44:52,342 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:44:52,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:44:52,343 INFO L82 PathProgramCache]: Analyzing trace with hash 724480386, now seen corresponding path program 1 times [2019-11-15 21:44:52,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:44:52,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202987023] [2019-11-15 21:44:52,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:52,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:44:52,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:44:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:44:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:44:52,427 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:44:52,427 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 21:44:52,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:44:52 BoogieIcfgContainer [2019-11-15 21:44:52,513 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:44:52,514 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:44:52,514 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:44:52,514 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:44:52,515 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:44:45" (3/4) ... [2019-11-15 21:44:52,517 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 21:44:52,675 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_841d075a-29bb-45ae-a88c-3af313a23aa7/bin/uautomizer/witness.graphml [2019-11-15 21:44:52,675 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:44:52,679 INFO L168 Benchmark]: Toolchain (without parser) took 9861.40 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 253.8 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -299.0 MB). Peak memory consumption was 273.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:44:52,679 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:44:52,680 INFO L168 Benchmark]: CACSL2BoogieTranslator took 615.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:44:52,680 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.51 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:44:52,681 INFO L168 Benchmark]: Boogie Preprocessor took 76.66 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:44:52,681 INFO L168 Benchmark]: RCFGBuilder took 1674.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 986.0 MB in the end (delta: 120.1 MB). Peak memory consumption was 120.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:44:52,682 INFO L168 Benchmark]: TraceAbstraction took 7219.88 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 58.7 MB). Free memory was 986.0 MB in the beginning and 863.0 MB in the end (delta: 123.0 MB). Peak memory consumption was 181.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:44:52,682 INFO L168 Benchmark]: Witness Printer took 161.68 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 66.1 MB). Free memory was 863.0 MB in the beginning and 1.2 GB in the end (delta: -380.8 MB). Peak memory consumption was 4.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:44:52,685 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.39 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 615.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 107.51 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.66 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. * RCFGBuilder took 1674.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 986.0 MB in the end (delta: 120.1 MB). Peak memory consumption was 120.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7219.88 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 58.7 MB). Free memory was 986.0 MB in the beginning and 863.0 MB in the end (delta: 123.0 MB). Peak memory consumption was 181.8 MB. Max. memory is 11.5 GB. * Witness Printer took 161.68 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 66.1 MB). Free memory was 863.0 MB in the beginning and 1.2 GB in the end (delta: -380.8 MB). Peak memory consumption was 4.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1011]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L21] int KernelMode ; [L22] int Executive ; [L23] int DevicePowerState ; [L24] int s ; [L25] int UNLOADED ; [L26] int NP ; [L27] int DC ; [L28] int SKIP1 ; [L29] int SKIP2 ; [L30] int MPR1 ; [L31] int MPR3 ; [L32] int IPC ; [L33] int pended ; [L34] int compFptr ; [L35] int compRegistered ; [L36] int lowerDriverReturn ; [L37] int setEventCalled ; [L38] int customIrp ; [L39] int myStatus ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=0, DevicePowerState=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, UNLOADED=0] [L292] int status ; [L293] int irp = __VERIFIER_nondet_int() ; [L294] int pirp ; [L295] int pirp__IoStatus__Status ; [L296] int irp_choice = __VERIFIER_nondet_int() ; [L297] int devobj = __VERIFIER_nondet_int() ; [L298] int __cil_tmp8 ; [L300] KernelMode = 0 [L301] Executive = 0 [L302] DevicePowerState = 1 [L303] s = 0 [L304] UNLOADED = 0 [L305] NP = 0 [L306] DC = 0 [L307] SKIP1 = 0 [L308] SKIP2 = 0 [L309] MPR1 = 0 [L310] MPR3 = 0 [L311] IPC = 0 [L312] pended = 0 [L313] compFptr = 0 [L314] compRegistered = 0 [L315] lowerDriverReturn = 0 [L316] setEventCalled = 0 [L317] customIrp = 0 [L318] myStatus = 0 [L322] status = 0 [L323] pirp = irp [L59] UNLOADED = 0 [L60] NP = 1 [L61] DC = 2 [L62] SKIP1 = 3 [L63] SKIP2 = 4 [L64] MPR1 = 5 [L65] MPR3 = 6 [L66] IPC = 7 [L67] s = UNLOADED [L68] pended = 0 [L69] compFptr = 0 [L70] compRegistered = 0 [L71] lowerDriverReturn = 0 [L72] setEventCalled = 0 [L73] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L326] COND TRUE status >= 0 [L327] s = NP [L328] customIrp = 0 [L329] setEventCalled = customIrp [L330] lowerDriverReturn = setEventCalled [L331] compRegistered = lowerDriverReturn [L332] pended = compRegistered [L333] pirp__IoStatus__Status = 0 [L334] myStatus = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L335] COND TRUE irp_choice == 0 [L336] pirp__IoStatus__Status = -1073741637 [L337] myStatus = -1073741637 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L45] s = NP [L46] pended = 0 [L47] compFptr = 0 [L48] compRegistered = 0 [L49] lowerDriverReturn = 0 [L50] setEventCalled = 0 [L51] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L343] COND FALSE !(status < 0) [L347] int tmp_ndt_1; [L348] tmp_ndt_1 = __VERIFIER_nondet_int() [L349] COND FALSE !(tmp_ndt_1 == 0) [L352] int tmp_ndt_2; [L353] tmp_ndt_2 = __VERIFIER_nondet_int() [L354] COND FALSE !(tmp_ndt_2 == 1) [L357] int tmp_ndt_3; [L358] tmp_ndt_3 = __VERIFIER_nondet_int() [L359] COND TRUE tmp_ndt_3 == 3 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L78] int devExt ; [L79] int irpStack ; [L80] int status ; [L81] int event = __VERIFIER_nondet_int() ; [L82] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L83] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L84] int irpStack__MinorFunction = __VERIFIER_nondet_int() ; [L85] int devExt__TopOfStack = __VERIFIER_nondet_int() ; [L86] int devExt__Started ; [L87] int devExt__Removed ; [L88] int devExt__SurpriseRemoved ; [L89] int Irp__IoStatus__Status ; [L90] int Irp__IoStatus__Information ; [L91] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L92] int irpSp ; [L93] int nextIrpSp ; [L94] int nextIrpSp__Control ; [L95] int irpSp___0 ; [L96] int irpSp__Context ; [L97] int irpSp__Control ; [L98] long __cil_tmp23 ; [L101] status = 0 [L102] devExt = DeviceObject__DeviceExtension [L103] irpStack = Irp__Tail__Overlay__CurrentStackLocation VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L104] COND FALSE !(irpStack__MinorFunction == 0) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L107] COND FALSE !(irpStack__MinorFunction == 23) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L110] COND TRUE irpStack__MinorFunction == 2 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L234] devExt__Removed = 1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L235] COND TRUE s == NP [L236] s = SKIP1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L243] Irp__CurrentLocation ++ [L244] Irp__Tail__Overlay__CurrentStackLocation ++ [L481] int returnVal2 ; [L482] int compRetStatus ; [L483] int lcontext = __VERIFIER_nondet_int() ; [L484] long long __cil_tmp7 ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L487] COND FALSE !(\read(compRegistered)) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L500] int tmp_ndt_6; [L501] tmp_ndt_6 = __VERIFIER_nondet_int() [L502] COND FALSE !(tmp_ndt_6 == 0) [L505] int tmp_ndt_7; [L506] tmp_ndt_7 = __VERIFIER_nondet_int() [L507] COND TRUE tmp_ndt_7 == 1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L516] returnVal2 = -1073741823 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L526] COND FALSE !(s == NP) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L530] COND FALSE !(s == MPR1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L539] COND TRUE s == SKIP1 [L540] s = SKIP2 [L541] lowerDriverReturn = returnVal2 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L549] return (returnVal2); VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L246] status = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L288] return (status); VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L386] status = KbFilter_PnP(devobj, pirp) [L410] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L418] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L426] COND TRUE s != UNLOADED VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L427] COND TRUE status != -1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L428] COND FALSE !(s != SKIP2) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L438] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L445] COND FALSE !(s == DC) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L450] COND TRUE status != lowerDriverReturn VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L1011] __VERIFIER_error() VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 330 locations, 30 error locations. Result: UNSAFE, OverallTime: 7.1s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7293 SDtfs, 4529 SDslu, 10689 SDs, 0 SdLazy, 2185 SolverSat, 305 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=351occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 26 MinimizatonAttempts, 610 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 803 NumberOfCodeBlocks, 803 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 740 ConstructedInterpolants, 0 QuantifiedInterpolants, 55626 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...