./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a3958f7a-f9d8-4303-8554-c1f368fd132e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a3958f7a-f9d8-4303-8554-c1f368fd132e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a3958f7a-f9d8-4303-8554-c1f368fd132e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a3958f7a-f9d8-4303-8554-c1f368fd132e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a3958f7a-f9d8-4303-8554-c1f368fd132e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a3958f7a-f9d8-4303-8554-c1f368fd132e/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 7ccaa093bf8ff79a61d120955ada15d034501ead .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 23:33:00,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:33:00,030 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:33:00,048 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:33:00,048 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:33:00,050 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:33:00,052 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:33:00,068 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:33:00,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:33:00,073 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:33:00,075 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:33:00,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:33:00,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:33:00,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:33:00,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:33:00,085 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:33:00,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:33:00,090 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:33:00,093 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:33:00,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:33:00,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:33:00,103 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:33:00,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:33:00,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:33:00,112 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:33:00,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:33:00,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:33:00,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:33:00,116 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:33:00,118 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:33:00,118 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:33:00,119 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:33:00,119 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:33:00,120 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:33:00,121 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:33:00,122 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:33:00,122 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:33:00,123 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:33:00,123 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:33:00,124 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:33:00,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:33:00,125 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a3958f7a-f9d8-4303-8554-c1f368fd132e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:33:00,141 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:33:00,141 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:33:00,142 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:33:00,143 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:33:00,143 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:33:00,143 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:33:00,143 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:33:00,143 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:33:00,144 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:33:00,144 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:33:00,144 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:33:00,144 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:33:00,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:33:00,145 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:33:00,145 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:33:00,145 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:33:00,146 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:33:00,146 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:33:00,146 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:33:00,146 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:33:00,147 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:33:00,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:33:00,147 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:33:00,147 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:33:00,148 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:33:00,148 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:33:00,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:33:00,148 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:33:00,149 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_a3958f7a-f9d8-4303-8554-c1f368fd132e/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 -> 7ccaa093bf8ff79a61d120955ada15d034501ead [2019-11-15 23:33:00,181 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:33:00,194 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:33:00,200 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:33:00,201 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:33:00,202 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:33:00,203 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a3958f7a-f9d8-4303-8554-c1f368fd132e/bin/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c [2019-11-15 23:33:00,276 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a3958f7a-f9d8-4303-8554-c1f368fd132e/bin/uautomizer/data/a360491b0/880ca4dda335471aa2062ac76c4e7836/FLAGd2ff89708 [2019-11-15 23:33:00,733 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:33:00,733 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a3958f7a-f9d8-4303-8554-c1f368fd132e/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c [2019-11-15 23:33:00,746 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a3958f7a-f9d8-4303-8554-c1f368fd132e/bin/uautomizer/data/a360491b0/880ca4dda335471aa2062ac76c4e7836/FLAGd2ff89708 [2019-11-15 23:33:01,089 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a3958f7a-f9d8-4303-8554-c1f368fd132e/bin/uautomizer/data/a360491b0/880ca4dda335471aa2062ac76c4e7836 [2019-11-15 23:33:01,092 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:33:01,093 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:33:01,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:33:01,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:33:01,097 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:33:01,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:33:01" (1/1) ... [2019-11-15 23:33:01,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ac1ccf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:01, skipping insertion in model container [2019-11-15 23:33:01,100 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:33:01" (1/1) ... [2019-11-15 23:33:01,109 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:33:01,166 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:33:01,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:33:01,543 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:33:01,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:33:01,657 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:33:01,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:01 WrapperNode [2019-11-15 23:33:01,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:33:01,659 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:33:01,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:33:01,660 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:33:01,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:01" (1/1) ... [2019-11-15 23:33:01,683 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:01" (1/1) ... [2019-11-15 23:33:01,764 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:33:01,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:33:01,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:33:01,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:33:01,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:01" (1/1) ... [2019-11-15 23:33:01,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:01" (1/1) ... [2019-11-15 23:33:01,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:01" (1/1) ... [2019-11-15 23:33:01,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:01" (1/1) ... [2019-11-15 23:33:01,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:01" (1/1) ... [2019-11-15 23:33:01,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:01" (1/1) ... [2019-11-15 23:33:01,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:01" (1/1) ... [2019-11-15 23:33:01,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:33:01,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:33:01,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:33:01,889 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:33:01,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a3958f7a-f9d8-4303-8554-c1f368fd132e/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:33:01,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:33:01,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:33:02,184 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:33:02,191 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:33:02,199 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:33:02,219 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:33:02,223 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:33:02,228 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:33:02,233 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:33:02,239 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:33:02,242 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:33:02,244 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:33:02,253 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:33:02,259 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:33:02,276 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:33:02,278 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:33:02,283 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:33:02,289 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:33:02,300 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:33:02,308 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:33:02,314 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:33:02,322 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:33:02,330 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:33:02,334 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:33:02,336 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:33:02,342 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:33:03,532 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume !false; [2019-11-15 23:33:03,533 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##415: assume false; [2019-11-15 23:33:03,533 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##445: assume false; [2019-11-15 23:33:03,534 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##290: assume false; [2019-11-15 23:33:03,534 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##291: assume !false; [2019-11-15 23:33:03,534 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##490: assume !false; [2019-11-15 23:33:03,534 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##269: assume false; [2019-11-15 23:33:03,535 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##270: assume !false; [2019-11-15 23:33:03,535 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##446: assume !false; [2019-11-15 23:33:03,535 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##209: assume false; [2019-11-15 23:33:03,536 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##210: assume !false; [2019-11-15 23:33:03,536 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2019-11-15 23:33:03,536 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2019-11-15 23:33:03,537 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##470: assume false; [2019-11-15 23:33:03,537 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##232: assume false; [2019-11-15 23:33:03,537 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##471: assume !false; [2019-11-15 23:33:03,537 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##233: assume !false; [2019-11-15 23:33:03,537 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##242: assume !false; [2019-11-15 23:33:03,538 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##241: assume false; [2019-11-15 23:33:03,538 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##489: assume false; [2019-11-15 23:33:03,538 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##246: assume !false; [2019-11-15 23:33:03,538 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##245: assume false; [2019-11-15 23:33:03,539 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-15 23:33:03,539 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-15 23:33:03,539 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume !false; [2019-11-15 23:33:03,540 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume false; [2019-11-15 23:33:03,540 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##175: assume !false; [2019-11-15 23:33:03,541 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##174: assume false; [2019-11-15 23:33:03,541 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##180: assume false; [2019-11-15 23:33:03,542 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##181: assume !false; [2019-11-15 23:33:03,542 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !false; [2019-11-15 23:33:03,542 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume false; [2019-11-15 23:33:03,542 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume false; [2019-11-15 23:33:03,543 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !false; [2019-11-15 23:33:03,543 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##34: assume false; [2019-11-15 23:33:03,543 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##138: assume !false; [2019-11-15 23:33:03,543 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##393: assume false; [2019-11-15 23:33:03,544 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2019-11-15 23:33:03,544 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##394: assume !false; [2019-11-15 23:33:03,544 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2019-11-15 23:33:03,545 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##164: assume !false; [2019-11-15 23:33:03,545 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume false; [2019-11-15 23:33:03,546 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##329: assume false; [2019-11-15 23:33:03,546 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##330: assume !false; [2019-11-15 23:33:03,546 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##108: assume !false; [2019-11-15 23:33:03,546 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##107: assume false; [2019-11-15 23:33:03,547 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##364: assume !false; [2019-11-15 23:33:03,547 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##363: assume false; [2019-11-15 23:33:03,548 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:33:03,549 INFO L284 CfgBuilder]: Removed 207 assume(true) statements. [2019-11-15 23:33:03,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:33:03 BoogieIcfgContainer [2019-11-15 23:33:03,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:33:03,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:33:03,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:33:03,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:33:03,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:33:01" (1/3) ... [2019-11-15 23:33:03,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a0b6f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:33:03, skipping insertion in model container [2019-11-15 23:33:03,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:01" (2/3) ... [2019-11-15 23:33:03,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a0b6f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:33:03, skipping insertion in model container [2019-11-15 23:33:03,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:33:03" (3/3) ... [2019-11-15 23:33:03,559 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-1.c [2019-11-15 23:33:03,568 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:33:03,580 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2019-11-15 23:33:03,590 INFO L249 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2019-11-15 23:33:03,618 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:33:03,618 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:33:03,618 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:33:03,619 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:33:03,619 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:33:03,619 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:33:03,619 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:33:03,619 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:33:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states. [2019-11-15 23:33:03,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 23:33:03,668 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:03,668 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:33:03,672 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:03,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:03,679 INFO L82 PathProgramCache]: Analyzing trace with hash 660910296, now seen corresponding path program 1 times [2019-11-15 23:33:03,687 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:03,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159743844] [2019-11-15 23:33:03,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:03,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:03,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:03,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:03,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159743844] [2019-11-15 23:33:03,840 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:03,840 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:33:03,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256673583] [2019-11-15 23:33:03,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:33:03,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:03,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:03,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:03,861 INFO L87 Difference]: Start difference. First operand 421 states. Second operand 3 states. [2019-11-15 23:33:03,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:03,977 INFO L93 Difference]: Finished difference Result 763 states and 1090 transitions. [2019-11-15 23:33:03,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:03,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-15 23:33:03,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:03,999 INFO L225 Difference]: With dead ends: 763 [2019-11-15 23:33:04,000 INFO L226 Difference]: Without dead ends: 416 [2019-11-15 23:33:04,006 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:04,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-11-15 23:33:04,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2019-11-15 23:33:04,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-15 23:33:04,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 546 transitions. [2019-11-15 23:33:04,094 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 546 transitions. Word has length 11 [2019-11-15 23:33:04,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:04,094 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 546 transitions. [2019-11-15 23:33:04,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:33:04,095 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 546 transitions. [2019-11-15 23:33:04,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 23:33:04,096 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:04,096 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:33:04,097 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:04,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:04,098 INFO L82 PathProgramCache]: Analyzing trace with hash -32433196, now seen corresponding path program 1 times [2019-11-15 23:33:04,098 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:04,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950707984] [2019-11-15 23:33:04,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:04,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:04,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:04,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:04,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950707984] [2019-11-15 23:33:04,187 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:04,188 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:33:04,188 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994488302] [2019-11-15 23:33:04,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:33:04,190 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:04,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:04,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:04,191 INFO L87 Difference]: Start difference. First operand 416 states and 546 transitions. Second operand 3 states. [2019-11-15 23:33:04,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:04,639 INFO L93 Difference]: Finished difference Result 714 states and 941 transitions. [2019-11-15 23:33:04,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:04,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-15 23:33:04,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:04,648 INFO L225 Difference]: With dead ends: 714 [2019-11-15 23:33:04,651 INFO L226 Difference]: Without dead ends: 547 [2019-11-15 23:33:04,654 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:04,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-11-15 23:33:04,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 521. [2019-11-15 23:33:04,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2019-11-15 23:33:04,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 697 transitions. [2019-11-15 23:33:04,755 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 697 transitions. Word has length 13 [2019-11-15 23:33:04,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:04,756 INFO L462 AbstractCegarLoop]: Abstraction has 521 states and 697 transitions. [2019-11-15 23:33:04,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:33:04,756 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 697 transitions. [2019-11-15 23:33:04,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 23:33:04,757 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:04,757 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:33:04,758 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:04,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:04,759 INFO L82 PathProgramCache]: Analyzing trace with hash 563627937, now seen corresponding path program 1 times [2019-11-15 23:33:04,759 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:04,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164599394] [2019-11-15 23:33:04,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:04,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:04,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:04,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:04,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164599394] [2019-11-15 23:33:04,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:04,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:33:04,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678843961] [2019-11-15 23:33:04,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:33:04,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:04,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:04,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:04,839 INFO L87 Difference]: Start difference. First operand 521 states and 697 transitions. Second operand 3 states. [2019-11-15 23:33:04,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:04,914 INFO L93 Difference]: Finished difference Result 1000 states and 1335 transitions. [2019-11-15 23:33:04,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:04,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-15 23:33:04,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:04,919 INFO L225 Difference]: With dead ends: 1000 [2019-11-15 23:33:04,919 INFO L226 Difference]: Without dead ends: 690 [2019-11-15 23:33:04,920 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:04,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-11-15 23:33:04,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 519. [2019-11-15 23:33:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-11-15 23:33:04,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 696 transitions. [2019-11-15 23:33:04,946 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 696 transitions. Word has length 16 [2019-11-15 23:33:04,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:04,946 INFO L462 AbstractCegarLoop]: Abstraction has 519 states and 696 transitions. [2019-11-15 23:33:04,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:33:04,947 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 696 transitions. [2019-11-15 23:33:04,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:33:04,948 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:04,948 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:33:04,949 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:04,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:04,949 INFO L82 PathProgramCache]: Analyzing trace with hash 6806604, now seen corresponding path program 1 times [2019-11-15 23:33:04,950 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:04,950 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076993770] [2019-11-15 23:33:04,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:04,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:04,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:05,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:05,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076993770] [2019-11-15 23:33:05,017 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:05,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:33:05,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344408708] [2019-11-15 23:33:05,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:33:05,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:05,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:05,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:05,019 INFO L87 Difference]: Start difference. First operand 519 states and 696 transitions. Second operand 3 states. [2019-11-15 23:33:05,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:05,073 INFO L93 Difference]: Finished difference Result 601 states and 797 transitions. [2019-11-15 23:33:05,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:05,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-15 23:33:05,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:05,078 INFO L225 Difference]: With dead ends: 601 [2019-11-15 23:33:05,078 INFO L226 Difference]: Without dead ends: 578 [2019-11-15 23:33:05,079 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:05,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-11-15 23:33:05,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 537. [2019-11-15 23:33:05,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-11-15 23:33:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 727 transitions. [2019-11-15 23:33:05,105 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 727 transitions. Word has length 19 [2019-11-15 23:33:05,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:05,105 INFO L462 AbstractCegarLoop]: Abstraction has 537 states and 727 transitions. [2019-11-15 23:33:05,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:33:05,106 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 727 transitions. [2019-11-15 23:33:05,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:33:05,107 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:05,108 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] [2019-11-15 23:33:05,108 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:05,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:05,109 INFO L82 PathProgramCache]: Analyzing trace with hash -450647822, now seen corresponding path program 1 times [2019-11-15 23:33:05,109 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:05,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34405586] [2019-11-15 23:33:05,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:05,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:05,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:05,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:05,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34405586] [2019-11-15 23:33:05,151 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:05,151 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:33:05,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660125865] [2019-11-15 23:33:05,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:33:05,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:05,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:05,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:05,152 INFO L87 Difference]: Start difference. First operand 537 states and 727 transitions. Second operand 3 states. [2019-11-15 23:33:05,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:05,425 INFO L93 Difference]: Finished difference Result 732 states and 987 transitions. [2019-11-15 23:33:05,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:05,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-15 23:33:05,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:05,430 INFO L225 Difference]: With dead ends: 732 [2019-11-15 23:33:05,431 INFO L226 Difference]: Without dead ends: 724 [2019-11-15 23:33:05,431 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:05,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-11-15 23:33:05,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 555. [2019-11-15 23:33:05,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-11-15 23:33:05,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 754 transitions. [2019-11-15 23:33:05,466 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 754 transitions. Word has length 22 [2019-11-15 23:33:05,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:05,467 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 754 transitions. [2019-11-15 23:33:05,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:33:05,468 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 754 transitions. [2019-11-15 23:33:05,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:33:05,474 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:05,474 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] [2019-11-15 23:33:05,475 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:05,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:05,475 INFO L82 PathProgramCache]: Analyzing trace with hash 364241657, now seen corresponding path program 1 times [2019-11-15 23:33:05,475 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:05,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883412701] [2019-11-15 23:33:05,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:05,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:05,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:05,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:05,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883412701] [2019-11-15 23:33:05,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:05,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:33:05,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758388346] [2019-11-15 23:33:05,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:33:05,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:05,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:05,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:05,547 INFO L87 Difference]: Start difference. First operand 555 states and 754 transitions. Second operand 3 states. [2019-11-15 23:33:05,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:05,786 INFO L93 Difference]: Finished difference Result 590 states and 798 transitions. [2019-11-15 23:33:05,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:05,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-15 23:33:05,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:05,791 INFO L225 Difference]: With dead ends: 590 [2019-11-15 23:33:05,791 INFO L226 Difference]: Without dead ends: 585 [2019-11-15 23:33:05,792 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:05,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-11-15 23:33:05,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 582. [2019-11-15 23:33:05,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-11-15 23:33:05,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 790 transitions. [2019-11-15 23:33:05,830 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 790 transitions. Word has length 22 [2019-11-15 23:33:05,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:05,830 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 790 transitions. [2019-11-15 23:33:05,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:33:05,831 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 790 transitions. [2019-11-15 23:33:05,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 23:33:05,833 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:05,834 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] [2019-11-15 23:33:05,839 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:05,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:05,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1092839096, now seen corresponding path program 1 times [2019-11-15 23:33:05,840 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:05,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210219108] [2019-11-15 23:33:05,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:05,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:05,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:05,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 23:33:05,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210219108] [2019-11-15 23:33:05,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:05,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:33:05,955 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947356552] [2019-11-15 23:33:05,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:33:05,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:05,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:33:05,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:33:05,956 INFO L87 Difference]: Start difference. First operand 582 states and 790 transitions. Second operand 7 states. [2019-11-15 23:33:06,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:06,742 INFO L93 Difference]: Finished difference Result 898 states and 1197 transitions. [2019-11-15 23:33:06,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:33:06,743 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-15 23:33:06,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:06,747 INFO L225 Difference]: With dead ends: 898 [2019-11-15 23:33:06,747 INFO L226 Difference]: Without dead ends: 637 [2019-11-15 23:33:06,748 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:33:06,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-11-15 23:33:06,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 565. [2019-11-15 23:33:06,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-11-15 23:33:06,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 754 transitions. [2019-11-15 23:33:06,806 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 754 transitions. Word has length 23 [2019-11-15 23:33:06,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:06,806 INFO L462 AbstractCegarLoop]: Abstraction has 565 states and 754 transitions. [2019-11-15 23:33:06,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:33:06,807 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 754 transitions. [2019-11-15 23:33:06,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 23:33:06,808 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:06,808 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] [2019-11-15 23:33:06,808 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:06,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:06,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1575831316, now seen corresponding path program 1 times [2019-11-15 23:33:06,809 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:06,809 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220194139] [2019-11-15 23:33:06,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:06,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:06,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:06,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:06,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220194139] [2019-11-15 23:33:06,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:06,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:33:06,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805958200] [2019-11-15 23:33:06,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:33:06,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:06,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:33:06,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:33:06,851 INFO L87 Difference]: Start difference. First operand 565 states and 754 transitions. Second operand 4 states. [2019-11-15 23:33:06,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:06,915 INFO L93 Difference]: Finished difference Result 578 states and 768 transitions. [2019-11-15 23:33:06,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:33:06,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-15 23:33:06,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:06,920 INFO L225 Difference]: With dead ends: 578 [2019-11-15 23:33:06,920 INFO L226 Difference]: Without dead ends: 563 [2019-11-15 23:33:06,921 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:33:06,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-11-15 23:33:06,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2019-11-15 23:33:06,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-11-15 23:33:06,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 751 transitions. [2019-11-15 23:33:06,957 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 751 transitions. Word has length 23 [2019-11-15 23:33:06,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:06,958 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 751 transitions. [2019-11-15 23:33:06,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:33:06,958 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 751 transitions. [2019-11-15 23:33:06,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 23:33:06,959 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:06,959 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] [2019-11-15 23:33:06,960 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:06,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:06,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1184010678, now seen corresponding path program 1 times [2019-11-15 23:33:06,961 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:06,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417594447] [2019-11-15 23:33:06,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:06,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:06,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:06,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417594447] [2019-11-15 23:33:06,991 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:06,991 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:33:06,992 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775379283] [2019-11-15 23:33:06,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:33:06,992 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:06,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:06,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:06,993 INFO L87 Difference]: Start difference. First operand 563 states and 751 transitions. Second operand 3 states. [2019-11-15 23:33:07,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:07,219 INFO L93 Difference]: Finished difference Result 563 states and 751 transitions. [2019-11-15 23:33:07,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:07,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 23:33:07,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:07,223 INFO L225 Difference]: With dead ends: 563 [2019-11-15 23:33:07,223 INFO L226 Difference]: Without dead ends: 551 [2019-11-15 23:33:07,224 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:07,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-11-15 23:33:07,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-11-15 23:33:07,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-11-15 23:33:07,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 738 transitions. [2019-11-15 23:33:07,257 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 738 transitions. Word has length 25 [2019-11-15 23:33:07,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:07,258 INFO L462 AbstractCegarLoop]: Abstraction has 551 states and 738 transitions. [2019-11-15 23:33:07,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:33:07,258 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 738 transitions. [2019-11-15 23:33:07,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 23:33:07,260 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:07,260 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] [2019-11-15 23:33:07,268 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:07,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:07,268 INFO L82 PathProgramCache]: Analyzing trace with hash -944626100, now seen corresponding path program 1 times [2019-11-15 23:33:07,269 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:07,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366946862] [2019-11-15 23:33:07,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:07,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:07,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:07,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:07,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366946862] [2019-11-15 23:33:07,327 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:07,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:33:07,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2154408] [2019-11-15 23:33:07,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:33:07,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:07,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:07,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:07,329 INFO L87 Difference]: Start difference. First operand 551 states and 738 transitions. Second operand 3 states. [2019-11-15 23:33:07,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:07,548 INFO L93 Difference]: Finished difference Result 759 states and 1016 transitions. [2019-11-15 23:33:07,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:07,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-15 23:33:07,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:07,553 INFO L225 Difference]: With dead ends: 759 [2019-11-15 23:33:07,554 INFO L226 Difference]: Without dead ends: 553 [2019-11-15 23:33:07,559 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:07,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-11-15 23:33:07,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2019-11-15 23:33:07,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-11-15 23:33:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 741 transitions. [2019-11-15 23:33:07,595 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 741 transitions. Word has length 28 [2019-11-15 23:33:07,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:07,596 INFO L462 AbstractCegarLoop]: Abstraction has 553 states and 741 transitions. [2019-11-15 23:33:07,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:33:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 741 transitions. [2019-11-15 23:33:07,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 23:33:07,597 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:07,598 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] [2019-11-15 23:33:07,598 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:07,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:07,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1312752221, now seen corresponding path program 1 times [2019-11-15 23:33:07,599 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:07,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626039885] [2019-11-15 23:33:07,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:07,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:07,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:07,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:07,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626039885] [2019-11-15 23:33:07,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:07,648 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:33:07,648 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501706501] [2019-11-15 23:33:07,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:33:07,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:07,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:07,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:07,649 INFO L87 Difference]: Start difference. First operand 553 states and 741 transitions. Second operand 3 states. [2019-11-15 23:33:07,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:07,713 INFO L93 Difference]: Finished difference Result 733 states and 975 transitions. [2019-11-15 23:33:07,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:07,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-15 23:33:07,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:07,720 INFO L225 Difference]: With dead ends: 733 [2019-11-15 23:33:07,720 INFO L226 Difference]: Without dead ends: 529 [2019-11-15 23:33:07,721 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:07,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-11-15 23:33:07,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 513. [2019-11-15 23:33:07,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2019-11-15 23:33:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 683 transitions. [2019-11-15 23:33:07,754 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 683 transitions. Word has length 29 [2019-11-15 23:33:07,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:07,755 INFO L462 AbstractCegarLoop]: Abstraction has 513 states and 683 transitions. [2019-11-15 23:33:07,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:33:07,755 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 683 transitions. [2019-11-15 23:33:07,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:33:07,757 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:07,758 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 23:33:07,758 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:07,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:07,762 INFO L82 PathProgramCache]: Analyzing trace with hash 259846608, now seen corresponding path program 1 times [2019-11-15 23:33:07,763 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:07,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681487370] [2019-11-15 23:33:07,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:07,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:07,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:07,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:07,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681487370] [2019-11-15 23:33:07,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:07,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:33:07,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642046884] [2019-11-15 23:33:07,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:33:07,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:07,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:33:07,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:33:07,831 INFO L87 Difference]: Start difference. First operand 513 states and 683 transitions. Second operand 5 states. [2019-11-15 23:33:08,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:08,195 INFO L93 Difference]: Finished difference Result 1324 states and 1762 transitions. [2019-11-15 23:33:08,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:33:08,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-15 23:33:08,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:08,202 INFO L225 Difference]: With dead ends: 1324 [2019-11-15 23:33:08,203 INFO L226 Difference]: Without dead ends: 1052 [2019-11-15 23:33:08,204 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:33:08,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-11-15 23:33:08,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 552. [2019-11-15 23:33:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-11-15 23:33:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 741 transitions. [2019-11-15 23:33:08,246 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 741 transitions. Word has length 32 [2019-11-15 23:33:08,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:08,246 INFO L462 AbstractCegarLoop]: Abstraction has 552 states and 741 transitions. [2019-11-15 23:33:08,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:33:08,246 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 741 transitions. [2019-11-15 23:33:08,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:33:08,248 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:08,248 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 23:33:08,248 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:08,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:08,249 INFO L82 PathProgramCache]: Analyzing trace with hash 255000751, now seen corresponding path program 1 times [2019-11-15 23:33:08,250 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:08,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113601409] [2019-11-15 23:33:08,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:08,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:08,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:08,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:08,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113601409] [2019-11-15 23:33:08,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:08,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:33:08,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881821943] [2019-11-15 23:33:08,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:33:08,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:08,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:33:08,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:33:08,312 INFO L87 Difference]: Start difference. First operand 552 states and 741 transitions. Second operand 5 states. [2019-11-15 23:33:08,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:08,425 INFO L93 Difference]: Finished difference Result 572 states and 763 transitions. [2019-11-15 23:33:08,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:33:08,426 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-15 23:33:08,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:08,430 INFO L225 Difference]: With dead ends: 572 [2019-11-15 23:33:08,430 INFO L226 Difference]: Without dead ends: 555 [2019-11-15 23:33:08,431 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 23:33:08,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-11-15 23:33:08,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 552. [2019-11-15 23:33:08,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-11-15 23:33:08,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 740 transitions. [2019-11-15 23:33:08,479 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 740 transitions. Word has length 32 [2019-11-15 23:33:08,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:08,480 INFO L462 AbstractCegarLoop]: Abstraction has 552 states and 740 transitions. [2019-11-15 23:33:08,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:33:08,480 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 740 transitions. [2019-11-15 23:33:08,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 23:33:08,481 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:08,481 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 23:33:08,482 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:08,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:08,482 INFO L82 PathProgramCache]: Analyzing trace with hash 175699761, now seen corresponding path program 1 times [2019-11-15 23:33:08,482 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:08,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550680469] [2019-11-15 23:33:08,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:08,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:08,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:08,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:08,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550680469] [2019-11-15 23:33:08,576 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:08,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:33:08,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299274832] [2019-11-15 23:33:08,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:33:08,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:08,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:08,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:08,578 INFO L87 Difference]: Start difference. First operand 552 states and 740 transitions. Second operand 3 states. [2019-11-15 23:33:08,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:08,643 INFO L93 Difference]: Finished difference Result 812 states and 1079 transitions. [2019-11-15 23:33:08,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:08,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-15 23:33:08,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:08,647 INFO L225 Difference]: With dead ends: 812 [2019-11-15 23:33:08,648 INFO L226 Difference]: Without dead ends: 613 [2019-11-15 23:33:08,648 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-11-15 23:33:08,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 540. [2019-11-15 23:33:08,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-11-15 23:33:08,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 722 transitions. [2019-11-15 23:33:08,692 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 722 transitions. Word has length 33 [2019-11-15 23:33:08,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:08,692 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 722 transitions. [2019-11-15 23:33:08,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:33:08,692 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 722 transitions. [2019-11-15 23:33:08,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 23:33:08,694 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:08,694 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 23:33:08,694 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:08,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:08,695 INFO L82 PathProgramCache]: Analyzing trace with hash -744399452, now seen corresponding path program 1 times [2019-11-15 23:33:08,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:08,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184532727] [2019-11-15 23:33:08,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:08,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:08,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:08,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:08,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184532727] [2019-11-15 23:33:08,726 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:08,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:33:08,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217513011] [2019-11-15 23:33:08,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:33:08,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:08,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:08,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:08,727 INFO L87 Difference]: Start difference. First operand 540 states and 722 transitions. Second operand 3 states. [2019-11-15 23:33:08,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:08,999 INFO L93 Difference]: Finished difference Result 716 states and 944 transitions. [2019-11-15 23:33:08,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:08,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-15 23:33:08,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:09,004 INFO L225 Difference]: With dead ends: 716 [2019-11-15 23:33:09,004 INFO L226 Difference]: Without dead ends: 703 [2019-11-15 23:33:09,005 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:09,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-11-15 23:33:09,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 587. [2019-11-15 23:33:09,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-11-15 23:33:09,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 779 transitions. [2019-11-15 23:33:09,054 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 779 transitions. Word has length 33 [2019-11-15 23:33:09,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:09,055 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 779 transitions. [2019-11-15 23:33:09,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:33:09,055 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 779 transitions. [2019-11-15 23:33:09,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 23:33:09,056 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:09,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, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:33:09,057 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:09,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:09,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1784201236, now seen corresponding path program 1 times [2019-11-15 23:33:09,058 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:09,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384056204] [2019-11-15 23:33:09,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:09,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:09,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:09,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:09,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384056204] [2019-11-15 23:33:09,088 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:09,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:33:09,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368458191] [2019-11-15 23:33:09,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:33:09,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:09,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:09,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:09,089 INFO L87 Difference]: Start difference. First operand 587 states and 779 transitions. Second operand 3 states. [2019-11-15 23:33:09,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:09,158 INFO L93 Difference]: Finished difference Result 625 states and 824 transitions. [2019-11-15 23:33:09,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:09,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-15 23:33:09,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:09,163 INFO L225 Difference]: With dead ends: 625 [2019-11-15 23:33:09,163 INFO L226 Difference]: Without dead ends: 581 [2019-11-15 23:33:09,164 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:09,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-11-15 23:33:09,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 577. [2019-11-15 23:33:09,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-11-15 23:33:09,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 758 transitions. [2019-11-15 23:33:09,211 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 758 transitions. Word has length 34 [2019-11-15 23:33:09,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:09,211 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 758 transitions. [2019-11-15 23:33:09,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:33:09,212 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 758 transitions. [2019-11-15 23:33:09,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 23:33:09,213 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:09,213 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 23:33:09,214 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:09,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:09,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1583955411, now seen corresponding path program 1 times [2019-11-15 23:33:09,214 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:09,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819400297] [2019-11-15 23:33:09,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:09,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:09,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:09,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:09,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819400297] [2019-11-15 23:33:09,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:09,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:33:09,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712079072] [2019-11-15 23:33:09,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:33:09,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:09,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:33:09,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:33:09,269 INFO L87 Difference]: Start difference. First operand 577 states and 758 transitions. Second operand 5 states. [2019-11-15 23:33:09,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:09,703 INFO L93 Difference]: Finished difference Result 601 states and 778 transitions. [2019-11-15 23:33:09,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:33:09,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-15 23:33:09,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:09,708 INFO L225 Difference]: With dead ends: 601 [2019-11-15 23:33:09,708 INFO L226 Difference]: Without dead ends: 589 [2019-11-15 23:33:09,709 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 23:33:09,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-11-15 23:33:09,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 577. [2019-11-15 23:33:09,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-11-15 23:33:09,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 756 transitions. [2019-11-15 23:33:09,765 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 756 transitions. Word has length 34 [2019-11-15 23:33:09,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:09,766 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 756 transitions. [2019-11-15 23:33:09,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:33:09,766 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 756 transitions. [2019-11-15 23:33:09,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 23:33:09,767 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:09,768 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 23:33:09,768 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:09,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:09,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1675490409, now seen corresponding path program 1 times [2019-11-15 23:33:09,769 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:09,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823744983] [2019-11-15 23:33:09,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:09,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:09,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:09,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823744983] [2019-11-15 23:33:09,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:09,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:33:09,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072192629] [2019-11-15 23:33:09,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:33:09,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:09,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:09,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:09,801 INFO L87 Difference]: Start difference. First operand 577 states and 756 transitions. Second operand 3 states. [2019-11-15 23:33:09,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:09,893 INFO L93 Difference]: Finished difference Result 820 states and 1058 transitions. [2019-11-15 23:33:09,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:09,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-15 23:33:09,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:09,898 INFO L225 Difference]: With dead ends: 820 [2019-11-15 23:33:09,898 INFO L226 Difference]: Without dead ends: 699 [2019-11-15 23:33:09,899 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:09,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-11-15 23:33:09,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 578. [2019-11-15 23:33:09,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-11-15 23:33:09,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 757 transitions. [2019-11-15 23:33:09,959 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 757 transitions. Word has length 34 [2019-11-15 23:33:09,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:09,959 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 757 transitions. [2019-11-15 23:33:09,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:33:09,959 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 757 transitions. [2019-11-15 23:33:09,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 23:33:09,961 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:09,961 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 23:33:09,961 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:09,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:09,962 INFO L82 PathProgramCache]: Analyzing trace with hash -930533145, now seen corresponding path program 1 times [2019-11-15 23:33:09,962 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:09,962 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863170084] [2019-11-15 23:33:09,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:09,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:09,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:10,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:10,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863170084] [2019-11-15 23:33:10,057 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:10,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:33:10,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522639044] [2019-11-15 23:33:10,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:33:10,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:10,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:33:10,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:33:10,059 INFO L87 Difference]: Start difference. First operand 578 states and 757 transitions. Second operand 4 states. [2019-11-15 23:33:10,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:10,181 INFO L93 Difference]: Finished difference Result 1366 states and 1768 transitions. [2019-11-15 23:33:10,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:33:10,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-11-15 23:33:10,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:10,187 INFO L225 Difference]: With dead ends: 1366 [2019-11-15 23:33:10,188 INFO L226 Difference]: Without dead ends: 797 [2019-11-15 23:33:10,189 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:33:10,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-11-15 23:33:10,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 670. [2019-11-15 23:33:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-11-15 23:33:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 871 transitions. [2019-11-15 23:33:10,294 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 871 transitions. Word has length 34 [2019-11-15 23:33:10,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:10,295 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 871 transitions. [2019-11-15 23:33:10,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:33:10,295 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 871 transitions. [2019-11-15 23:33:10,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 23:33:10,296 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:10,297 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 23:33:10,298 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:10,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:10,298 INFO L82 PathProgramCache]: Analyzing trace with hash -992572759, now seen corresponding path program 1 times [2019-11-15 23:33:10,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:10,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022880290] [2019-11-15 23:33:10,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:10,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:10,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:10,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:10,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022880290] [2019-11-15 23:33:10,454 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:10,454 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:33:10,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618567315] [2019-11-15 23:33:10,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:33:10,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:10,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:33:10,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:33:10,455 INFO L87 Difference]: Start difference. First operand 670 states and 871 transitions. Second operand 4 states. [2019-11-15 23:33:10,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:10,590 INFO L93 Difference]: Finished difference Result 859 states and 1114 transitions. [2019-11-15 23:33:10,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:33:10,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-11-15 23:33:10,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:10,595 INFO L225 Difference]: With dead ends: 859 [2019-11-15 23:33:10,595 INFO L226 Difference]: Without dead ends: 640 [2019-11-15 23:33:10,596 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:33:10,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-11-15 23:33:10,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 635. [2019-11-15 23:33:10,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-11-15 23:33:10,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 820 transitions. [2019-11-15 23:33:10,662 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 820 transitions. Word has length 34 [2019-11-15 23:33:10,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:10,662 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 820 transitions. [2019-11-15 23:33:10,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:33:10,663 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 820 transitions. [2019-11-15 23:33:10,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:33:10,664 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:10,664 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 23:33:10,665 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:10,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:10,665 INFO L82 PathProgramCache]: Analyzing trace with hash -19558115, now seen corresponding path program 1 times [2019-11-15 23:33:10,665 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:10,666 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658535483] [2019-11-15 23:33:10,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:10,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:10,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:10,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:10,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658535483] [2019-11-15 23:33:10,722 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:10,722 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:33:10,722 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078206087] [2019-11-15 23:33:10,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:33:10,723 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:10,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:33:10,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:33:10,724 INFO L87 Difference]: Start difference. First operand 635 states and 820 transitions. Second operand 4 states. [2019-11-15 23:33:11,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:11,012 INFO L93 Difference]: Finished difference Result 647 states and 830 transitions. [2019-11-15 23:33:11,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:33:11,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 23:33:11,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:11,017 INFO L225 Difference]: With dead ends: 647 [2019-11-15 23:33:11,017 INFO L226 Difference]: Without dead ends: 580 [2019-11-15 23:33:11,018 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:33:11,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-11-15 23:33:11,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-11-15 23:33:11,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-11-15 23:33:11,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 741 transitions. [2019-11-15 23:33:11,077 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 741 transitions. Word has length 35 [2019-11-15 23:33:11,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:11,077 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 741 transitions. [2019-11-15 23:33:11,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:33:11,078 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 741 transitions. [2019-11-15 23:33:11,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:33:11,079 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:11,079 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 23:33:11,080 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:11,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:11,080 INFO L82 PathProgramCache]: Analyzing trace with hash 813687739, now seen corresponding path program 1 times [2019-11-15 23:33:11,080 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:11,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238898731] [2019-11-15 23:33:11,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:11,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:11,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:11,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:11,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238898731] [2019-11-15 23:33:11,147 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:11,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:33:11,148 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101221141] [2019-11-15 23:33:11,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:33:11,148 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:11,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:33:11,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:33:11,149 INFO L87 Difference]: Start difference. First operand 580 states and 741 transitions. Second operand 4 states. [2019-11-15 23:33:11,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:11,415 INFO L93 Difference]: Finished difference Result 653 states and 823 transitions. [2019-11-15 23:33:11,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:33:11,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 23:33:11,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:11,420 INFO L225 Difference]: With dead ends: 653 [2019-11-15 23:33:11,420 INFO L226 Difference]: Without dead ends: 564 [2019-11-15 23:33:11,421 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:33:11,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-11-15 23:33:11,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 546. [2019-11-15 23:33:11,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-11-15 23:33:11,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 684 transitions. [2019-11-15 23:33:11,486 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 684 transitions. Word has length 35 [2019-11-15 23:33:11,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:11,487 INFO L462 AbstractCegarLoop]: Abstraction has 546 states and 684 transitions. [2019-11-15 23:33:11,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:33:11,487 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 684 transitions. [2019-11-15 23:33:11,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:33:11,488 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:11,488 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 23:33:11,489 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:11,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:11,489 INFO L82 PathProgramCache]: Analyzing trace with hash -759040003, now seen corresponding path program 1 times [2019-11-15 23:33:11,489 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:11,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808557459] [2019-11-15 23:33:11,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:11,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:11,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:11,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:11,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808557459] [2019-11-15 23:33:11,524 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:11,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:33:11,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972576736] [2019-11-15 23:33:11,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:33:11,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:11,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:11,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:11,525 INFO L87 Difference]: Start difference. First operand 546 states and 684 transitions. Second operand 3 states. [2019-11-15 23:33:11,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:11,694 INFO L93 Difference]: Finished difference Result 569 states and 703 transitions. [2019-11-15 23:33:11,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:11,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-15 23:33:11,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:11,698 INFO L225 Difference]: With dead ends: 569 [2019-11-15 23:33:11,699 INFO L226 Difference]: Without dead ends: 549 [2019-11-15 23:33:11,699 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:11,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-11-15 23:33:11,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 540. [2019-11-15 23:33:11,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-11-15 23:33:11,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 673 transitions. [2019-11-15 23:33:11,757 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 673 transitions. Word has length 35 [2019-11-15 23:33:11,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:11,758 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 673 transitions. [2019-11-15 23:33:11,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:33:11,758 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 673 transitions. [2019-11-15 23:33:11,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:33:11,759 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:11,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] [2019-11-15 23:33:11,760 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:11,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:11,761 INFO L82 PathProgramCache]: Analyzing trace with hash 111409610, now seen corresponding path program 1 times [2019-11-15 23:33:11,761 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:11,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383898845] [2019-11-15 23:33:11,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:11,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:11,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:11,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:11,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383898845] [2019-11-15 23:33:11,818 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:11,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:33:11,818 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115960571] [2019-11-15 23:33:11,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:33:11,819 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:11,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:33:11,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:33:11,821 INFO L87 Difference]: Start difference. First operand 540 states and 673 transitions. Second operand 4 states. [2019-11-15 23:33:12,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:12,085 INFO L93 Difference]: Finished difference Result 721 states and 907 transitions. [2019-11-15 23:33:12,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:33:12,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 23:33:12,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:12,090 INFO L225 Difference]: With dead ends: 721 [2019-11-15 23:33:12,090 INFO L226 Difference]: Without dead ends: 537 [2019-11-15 23:33:12,092 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:33:12,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-11-15 23:33:12,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2019-11-15 23:33:12,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-11-15 23:33:12,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 664 transitions. [2019-11-15 23:33:12,173 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 664 transitions. Word has length 35 [2019-11-15 23:33:12,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:12,173 INFO L462 AbstractCegarLoop]: Abstraction has 537 states and 664 transitions. [2019-11-15 23:33:12,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:33:12,174 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 664 transitions. [2019-11-15 23:33:12,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:33:12,175 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:12,175 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 23:33:12,176 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:12,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:12,176 INFO L82 PathProgramCache]: Analyzing trace with hash 2063815052, now seen corresponding path program 1 times [2019-11-15 23:33:12,177 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:12,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716339547] [2019-11-15 23:33:12,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:12,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:12,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:12,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:12,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716339547] [2019-11-15 23:33:12,249 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:12,250 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:33:12,250 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392488244] [2019-11-15 23:33:12,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:33:12,251 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:12,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:33:12,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:33:12,252 INFO L87 Difference]: Start difference. First operand 537 states and 664 transitions. Second operand 4 states. [2019-11-15 23:33:12,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:12,518 INFO L93 Difference]: Finished difference Result 550 states and 674 transitions. [2019-11-15 23:33:12,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:33:12,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-15 23:33:12,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:12,522 INFO L225 Difference]: With dead ends: 550 [2019-11-15 23:33:12,522 INFO L226 Difference]: Without dead ends: 541 [2019-11-15 23:33:12,523 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:33:12,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-11-15 23:33:12,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 537. [2019-11-15 23:33:12,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-11-15 23:33:12,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 662 transitions. [2019-11-15 23:33:12,589 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 662 transitions. Word has length 36 [2019-11-15 23:33:12,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:12,589 INFO L462 AbstractCegarLoop]: Abstraction has 537 states and 662 transitions. [2019-11-15 23:33:12,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:33:12,590 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 662 transitions. [2019-11-15 23:33:12,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:33:12,591 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:12,591 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 23:33:12,592 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:12,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:12,592 INFO L82 PathProgramCache]: Analyzing trace with hash -2037812492, now seen corresponding path program 1 times [2019-11-15 23:33:12,592 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:12,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262005896] [2019-11-15 23:33:12,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:12,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:12,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:12,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:12,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262005896] [2019-11-15 23:33:12,720 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:12,721 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:33:12,721 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458357544] [2019-11-15 23:33:12,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:33:12,721 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:12,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:33:12,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:33:12,722 INFO L87 Difference]: Start difference. First operand 537 states and 662 transitions. Second operand 7 states. [2019-11-15 23:33:13,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:13,190 INFO L93 Difference]: Finished difference Result 784 states and 953 transitions. [2019-11-15 23:33:13,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:33:13,191 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-11-15 23:33:13,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:13,196 INFO L225 Difference]: With dead ends: 784 [2019-11-15 23:33:13,196 INFO L226 Difference]: Without dead ends: 764 [2019-11-15 23:33:13,196 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:33:13,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-11-15 23:33:13,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 536. [2019-11-15 23:33:13,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-11-15 23:33:13,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 660 transitions. [2019-11-15 23:33:13,256 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 660 transitions. Word has length 36 [2019-11-15 23:33:13,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:13,257 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 660 transitions. [2019-11-15 23:33:13,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:33:13,257 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 660 transitions. [2019-11-15 23:33:13,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 23:33:13,258 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:13,258 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 23:33:13,259 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:13,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:13,259 INFO L82 PathProgramCache]: Analyzing trace with hash -463076180, now seen corresponding path program 1 times [2019-11-15 23:33:13,259 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:13,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697098920] [2019-11-15 23:33:13,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:13,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:13,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:13,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:13,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697098920] [2019-11-15 23:33:13,294 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:13,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:33:13,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147859878] [2019-11-15 23:33:13,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:33:13,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:13,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:33:13,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:33:13,295 INFO L87 Difference]: Start difference. First operand 536 states and 660 transitions. Second operand 4 states. [2019-11-15 23:33:13,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:13,503 INFO L93 Difference]: Finished difference Result 549 states and 670 transitions. [2019-11-15 23:33:13,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:33:13,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-15 23:33:13,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:13,508 INFO L225 Difference]: With dead ends: 549 [2019-11-15 23:33:13,508 INFO L226 Difference]: Without dead ends: 540 [2019-11-15 23:33:13,508 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:33:13,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-11-15 23:33:13,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 536. [2019-11-15 23:33:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-11-15 23:33:13,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 658 transitions. [2019-11-15 23:33:13,577 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 658 transitions. Word has length 37 [2019-11-15 23:33:13,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:13,578 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 658 transitions. [2019-11-15 23:33:13,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:33:13,578 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 658 transitions. [2019-11-15 23:33:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 23:33:13,582 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:13,582 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 23:33:13,582 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:13,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:13,583 INFO L82 PathProgramCache]: Analyzing trace with hash -187254176, now seen corresponding path program 1 times [2019-11-15 23:33:13,583 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:13,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341597012] [2019-11-15 23:33:13,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:13,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:13,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:13,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:13,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341597012] [2019-11-15 23:33:13,674 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:13,674 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:33:13,674 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856229271] [2019-11-15 23:33:13,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:33:13,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:13,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:33:13,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:33:13,675 INFO L87 Difference]: Start difference. First operand 536 states and 658 transitions. Second operand 6 states. [2019-11-15 23:33:14,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:14,029 INFO L93 Difference]: Finished difference Result 554 states and 674 transitions. [2019-11-15 23:33:14,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:33:14,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-11-15 23:33:14,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:14,033 INFO L225 Difference]: With dead ends: 554 [2019-11-15 23:33:14,033 INFO L226 Difference]: Without dead ends: 551 [2019-11-15 23:33:14,034 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 23:33:14,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-11-15 23:33:14,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 542. [2019-11-15 23:33:14,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-11-15 23:33:14,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 664 transitions. [2019-11-15 23:33:14,104 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 664 transitions. Word has length 37 [2019-11-15 23:33:14,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:14,105 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 664 transitions. [2019-11-15 23:33:14,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:33:14,105 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 664 transitions. [2019-11-15 23:33:14,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 23:33:14,106 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:14,107 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 23:33:14,107 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:14,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:14,107 INFO L82 PathProgramCache]: Analyzing trace with hash -187266092, now seen corresponding path program 1 times [2019-11-15 23:33:14,108 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:14,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518511430] [2019-11-15 23:33:14,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:14,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:14,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:14,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:14,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518511430] [2019-11-15 23:33:14,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:14,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 23:33:14,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810366515] [2019-11-15 23:33:14,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:33:14,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:14,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:33:14,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:33:14,269 INFO L87 Difference]: Start difference. First operand 542 states and 664 transitions. Second operand 10 states. [2019-11-15 23:33:15,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:15,492 INFO L93 Difference]: Finished difference Result 820 states and 999 transitions. [2019-11-15 23:33:15,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:33:15,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-11-15 23:33:15,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:15,498 INFO L225 Difference]: With dead ends: 820 [2019-11-15 23:33:15,498 INFO L226 Difference]: Without dead ends: 803 [2019-11-15 23:33:15,501 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:33:15,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2019-11-15 23:33:15,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 595. [2019-11-15 23:33:15,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-11-15 23:33:15,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 721 transitions. [2019-11-15 23:33:15,584 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 721 transitions. Word has length 37 [2019-11-15 23:33:15,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:15,584 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 721 transitions. [2019-11-15 23:33:15,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:33:15,585 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 721 transitions. [2019-11-15 23:33:15,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 23:33:15,586 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:15,586 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 23:33:15,586 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:15,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:15,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1498284948, now seen corresponding path program 1 times [2019-11-15 23:33:15,587 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:15,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294509772] [2019-11-15 23:33:15,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:15,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:15,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:15,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:15,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294509772] [2019-11-15 23:33:15,640 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:15,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:33:15,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246312395] [2019-11-15 23:33:15,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:33:15,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:15,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:33:15,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:33:15,642 INFO L87 Difference]: Start difference. First operand 595 states and 721 transitions. Second operand 5 states. [2019-11-15 23:33:15,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:15,931 INFO L93 Difference]: Finished difference Result 604 states and 728 transitions. [2019-11-15 23:33:15,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:33:15,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-11-15 23:33:15,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:15,935 INFO L225 Difference]: With dead ends: 604 [2019-11-15 23:33:15,936 INFO L226 Difference]: Without dead ends: 581 [2019-11-15 23:33:15,936 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:33:15,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-11-15 23:33:16,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 523. [2019-11-15 23:33:16,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-11-15 23:33:16,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 642 transitions. [2019-11-15 23:33:16,013 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 642 transitions. Word has length 37 [2019-11-15 23:33:16,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:16,014 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 642 transitions. [2019-11-15 23:33:16,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:33:16,014 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 642 transitions. [2019-11-15 23:33:16,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 23:33:16,015 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:16,016 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:33:16,016 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:16,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:16,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1481841291, now seen corresponding path program 1 times [2019-11-15 23:33:16,017 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:16,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564748487] [2019-11-15 23:33:16,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:16,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:16,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:16,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:16,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564748487] [2019-11-15 23:33:16,068 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:16,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:33:16,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272228037] [2019-11-15 23:33:16,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:33:16,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:16,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:33:16,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:33:16,069 INFO L87 Difference]: Start difference. First operand 523 states and 642 transitions. Second operand 4 states. [2019-11-15 23:33:16,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:16,156 INFO L93 Difference]: Finished difference Result 541 states and 658 transitions. [2019-11-15 23:33:16,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:33:16,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-15 23:33:16,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:16,160 INFO L225 Difference]: With dead ends: 541 [2019-11-15 23:33:16,160 INFO L226 Difference]: Without dead ends: 520 [2019-11-15 23:33:16,160 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:33:16,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-11-15 23:33:16,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 506. [2019-11-15 23:33:16,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-11-15 23:33:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 622 transitions. [2019-11-15 23:33:16,248 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 622 transitions. Word has length 38 [2019-11-15 23:33:16,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:16,248 INFO L462 AbstractCegarLoop]: Abstraction has 506 states and 622 transitions. [2019-11-15 23:33:16,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:33:16,248 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 622 transitions. [2019-11-15 23:33:16,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 23:33:16,250 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:16,250 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:33:16,251 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:16,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:16,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1021756590, now seen corresponding path program 1 times [2019-11-15 23:33:16,251 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:16,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076512805] [2019-11-15 23:33:16,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:16,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:16,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:16,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:16,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076512805] [2019-11-15 23:33:16,285 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:16,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:33:16,285 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544011684] [2019-11-15 23:33:16,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:33:16,285 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:16,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:16,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:16,286 INFO L87 Difference]: Start difference. First operand 506 states and 622 transitions. Second operand 3 states. [2019-11-15 23:33:16,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:16,495 INFO L93 Difference]: Finished difference Result 870 states and 1065 transitions. [2019-11-15 23:33:16,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:16,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-15 23:33:16,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:16,500 INFO L225 Difference]: With dead ends: 870 [2019-11-15 23:33:16,501 INFO L226 Difference]: Without dead ends: 689 [2019-11-15 23:33:16,503 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:16,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-11-15 23:33:16,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 509. [2019-11-15 23:33:16,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-11-15 23:33:16,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 625 transitions. [2019-11-15 23:33:16,585 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 625 transitions. Word has length 38 [2019-11-15 23:33:16,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:16,586 INFO L462 AbstractCegarLoop]: Abstraction has 509 states and 625 transitions. [2019-11-15 23:33:16,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:33:16,586 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 625 transitions. [2019-11-15 23:33:16,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 23:33:16,592 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:16,592 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:33:16,593 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:16,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:16,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1329794158, now seen corresponding path program 1 times [2019-11-15 23:33:16,594 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:16,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075591705] [2019-11-15 23:33:16,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:16,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:16,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:16,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075591705] [2019-11-15 23:33:16,681 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:16,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:33:16,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490748864] [2019-11-15 23:33:16,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:33:16,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:16,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:33:16,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:33:16,682 INFO L87 Difference]: Start difference. First operand 509 states and 625 transitions. Second operand 5 states. [2019-11-15 23:33:17,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:17,017 INFO L93 Difference]: Finished difference Result 855 states and 1033 transitions. [2019-11-15 23:33:17,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:33:17,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-11-15 23:33:17,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:17,022 INFO L225 Difference]: With dead ends: 855 [2019-11-15 23:33:17,022 INFO L226 Difference]: Without dead ends: 699 [2019-11-15 23:33:17,024 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 23:33:17,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-11-15 23:33:17,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 509. [2019-11-15 23:33:17,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-11-15 23:33:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 621 transitions. [2019-11-15 23:33:17,110 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 621 transitions. Word has length 38 [2019-11-15 23:33:17,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:17,110 INFO L462 AbstractCegarLoop]: Abstraction has 509 states and 621 transitions. [2019-11-15 23:33:17,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:33:17,111 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 621 transitions. [2019-11-15 23:33:17,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 23:33:17,112 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:17,112 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:33:17,113 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:17,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:17,113 INFO L82 PathProgramCache]: Analyzing trace with hash 595887759, now seen corresponding path program 1 times [2019-11-15 23:33:17,113 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:17,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614543041] [2019-11-15 23:33:17,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:17,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:17,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:17,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:17,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614543041] [2019-11-15 23:33:17,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:17,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:33:17,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737817136] [2019-11-15 23:33:17,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:33:17,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:17,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:33:17,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:33:17,212 INFO L87 Difference]: Start difference. First operand 509 states and 621 transitions. Second operand 5 states. [2019-11-15 23:33:17,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:17,537 INFO L93 Difference]: Finished difference Result 977 states and 1195 transitions. [2019-11-15 23:33:17,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:33:17,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-15 23:33:17,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:17,542 INFO L225 Difference]: With dead ends: 977 [2019-11-15 23:33:17,542 INFO L226 Difference]: Without dead ends: 847 [2019-11-15 23:33:17,543 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:33:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-11-15 23:33:17,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 509. [2019-11-15 23:33:17,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-11-15 23:33:17,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 620 transitions. [2019-11-15 23:33:17,615 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 620 transitions. Word has length 41 [2019-11-15 23:33:17,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:17,615 INFO L462 AbstractCegarLoop]: Abstraction has 509 states and 620 transitions. [2019-11-15 23:33:17,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:33:17,616 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 620 transitions. [2019-11-15 23:33:17,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 23:33:17,617 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:17,617 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:33:17,618 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:17,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:17,618 INFO L82 PathProgramCache]: Analyzing trace with hash 768333102, now seen corresponding path program 1 times [2019-11-15 23:33:17,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:17,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566809485] [2019-11-15 23:33:17,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:17,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:17,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:17,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566809485] [2019-11-15 23:33:17,676 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:17,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:33:17,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202022899] [2019-11-15 23:33:17,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:33:17,677 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:17,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:33:17,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:33:17,677 INFO L87 Difference]: Start difference. First operand 509 states and 620 transitions. Second operand 7 states. [2019-11-15 23:33:18,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:18,006 INFO L93 Difference]: Finished difference Result 527 states and 637 transitions. [2019-11-15 23:33:18,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:33:18,007 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-11-15 23:33:18,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:18,009 INFO L225 Difference]: With dead ends: 527 [2019-11-15 23:33:18,009 INFO L226 Difference]: Without dead ends: 385 [2019-11-15 23:33:18,009 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 23:33:18,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-11-15 23:33:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 367. [2019-11-15 23:33:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-11-15 23:33:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 446 transitions. [2019-11-15 23:33:18,065 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 446 transitions. Word has length 41 [2019-11-15 23:33:18,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:18,066 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 446 transitions. [2019-11-15 23:33:18,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:33:18,066 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 446 transitions. [2019-11-15 23:33:18,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 23:33:18,067 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:18,068 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:33:18,068 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:18,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:18,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1022149612, now seen corresponding path program 1 times [2019-11-15 23:33:18,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:18,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744765114] [2019-11-15 23:33:18,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:18,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:18,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:18,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:18,100 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744765114] [2019-11-15 23:33:18,100 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:18,100 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:33:18,101 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691693589] [2019-11-15 23:33:18,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:33:18,101 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:18,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:18,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:18,102 INFO L87 Difference]: Start difference. First operand 367 states and 446 transitions. Second operand 3 states. [2019-11-15 23:33:18,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:18,245 INFO L93 Difference]: Finished difference Result 500 states and 615 transitions. [2019-11-15 23:33:18,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:18,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-15 23:33:18,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:18,248 INFO L225 Difference]: With dead ends: 500 [2019-11-15 23:33:18,249 INFO L226 Difference]: Without dead ends: 329 [2019-11-15 23:33:18,249 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:18,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-11-15 23:33:18,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2019-11-15 23:33:18,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-11-15 23:33:18,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 397 transitions. [2019-11-15 23:33:18,299 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 397 transitions. Word has length 45 [2019-11-15 23:33:18,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:18,300 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 397 transitions. [2019-11-15 23:33:18,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:33:18,300 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 397 transitions. [2019-11-15 23:33:18,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 23:33:18,301 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:18,301 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:33:18,302 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:18,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:18,302 INFO L82 PathProgramCache]: Analyzing trace with hash 632304062, now seen corresponding path program 1 times [2019-11-15 23:33:18,302 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:18,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975996429] [2019-11-15 23:33:18,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:18,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:18,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:18,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:18,367 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975996429] [2019-11-15 23:33:18,367 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:18,367 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:33:18,367 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778753704] [2019-11-15 23:33:18,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:33:18,369 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:18,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:33:18,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:33:18,370 INFO L87 Difference]: Start difference. First operand 329 states and 397 transitions. Second operand 7 states. [2019-11-15 23:33:18,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:18,677 INFO L93 Difference]: Finished difference Result 459 states and 546 transitions. [2019-11-15 23:33:18,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:33:18,678 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-11-15 23:33:18,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:18,681 INFO L225 Difference]: With dead ends: 459 [2019-11-15 23:33:18,681 INFO L226 Difference]: Without dead ends: 441 [2019-11-15 23:33:18,683 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:33:18,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-11-15 23:33:18,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 335. [2019-11-15 23:33:18,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-11-15 23:33:18,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 403 transitions. [2019-11-15 23:33:18,735 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 403 transitions. Word has length 51 [2019-11-15 23:33:18,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:18,735 INFO L462 AbstractCegarLoop]: Abstraction has 335 states and 403 transitions. [2019-11-15 23:33:18,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:33:18,736 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 403 transitions. [2019-11-15 23:33:18,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 23:33:18,737 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:18,737 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:33:18,737 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:18,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:18,738 INFO L82 PathProgramCache]: Analyzing trace with hash -605199811, now seen corresponding path program 1 times [2019-11-15 23:33:18,738 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:18,738 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462834909] [2019-11-15 23:33:18,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:18,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:18,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:18,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:18,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462834909] [2019-11-15 23:33:18,809 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:18,810 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:33:18,810 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887497539] [2019-11-15 23:33:18,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:33:18,810 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:18,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:33:18,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:33:18,811 INFO L87 Difference]: Start difference. First operand 335 states and 403 transitions. Second operand 7 states. [2019-11-15 23:33:19,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:19,085 INFO L93 Difference]: Finished difference Result 464 states and 551 transitions. [2019-11-15 23:33:19,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:33:19,086 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-15 23:33:19,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:19,089 INFO L225 Difference]: With dead ends: 464 [2019-11-15 23:33:19,089 INFO L226 Difference]: Without dead ends: 446 [2019-11-15 23:33:19,089 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 23:33:19,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-11-15 23:33:19,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 329. [2019-11-15 23:33:19,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-11-15 23:33:19,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 396 transitions. [2019-11-15 23:33:19,140 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 396 transitions. Word has length 52 [2019-11-15 23:33:19,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:19,140 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 396 transitions. [2019-11-15 23:33:19,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:33:19,141 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 396 transitions. [2019-11-15 23:33:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:33:19,142 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:19,142 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:33:19,145 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:19,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:19,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1054423066, now seen corresponding path program 1 times [2019-11-15 23:33:19,146 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:19,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157273678] [2019-11-15 23:33:19,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:19,147 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:19,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:19,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:19,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157273678] [2019-11-15 23:33:19,183 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:19,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:33:19,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547478471] [2019-11-15 23:33:19,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:33:19,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:19,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:19,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:19,184 INFO L87 Difference]: Start difference. First operand 329 states and 396 transitions. Second operand 3 states. [2019-11-15 23:33:19,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:19,259 INFO L93 Difference]: Finished difference Result 575 states and 698 transitions. [2019-11-15 23:33:19,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:19,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-15 23:33:19,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:19,261 INFO L225 Difference]: With dead ends: 575 [2019-11-15 23:33:19,261 INFO L226 Difference]: Without dead ends: 383 [2019-11-15 23:33:19,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 23:33:19,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-11-15 23:33:19,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 329. [2019-11-15 23:33:19,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-11-15 23:33:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 392 transitions. [2019-11-15 23:33:19,356 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 392 transitions. Word has length 54 [2019-11-15 23:33:19,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:19,356 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 392 transitions. [2019-11-15 23:33:19,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:33:19,356 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 392 transitions. [2019-11-15 23:33:19,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 23:33:19,357 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:19,357 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:33:19,358 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:19,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:19,358 INFO L82 PathProgramCache]: Analyzing trace with hash 273758220, now seen corresponding path program 1 times [2019-11-15 23:33:19,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:19,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223238168] [2019-11-15 23:33:19,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:19,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:19,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:19,456 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:19,456 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:33:19,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:33:19 BoogieIcfgContainer [2019-11-15 23:33:19,609 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:33:19,610 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:33:19,610 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:33:19,610 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:33:19,611 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:33:03" (3/4) ... [2019-11-15 23:33:19,613 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:33:19,749 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a3958f7a-f9d8-4303-8554-c1f368fd132e/bin/uautomizer/witness.graphml [2019-11-15 23:33:19,749 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:33:19,751 INFO L168 Benchmark]: Toolchain (without parser) took 18657.87 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 541.6 MB). Free memory was 939.4 MB in the beginning and 1.5 GB in the end (delta: -524.2 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:19,752 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:33:19,752 INFO L168 Benchmark]: CACSL2BoogieTranslator took 565.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -196.2 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:19,753 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:19,753 INFO L168 Benchmark]: Boogie Preprocessor took 124.07 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:19,753 INFO L168 Benchmark]: RCFGBuilder took 1661.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 976.7 MB in the end (delta: 146.8 MB). Peak memory consumption was 146.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:19,754 INFO L168 Benchmark]: TraceAbstraction took 16057.68 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 390.1 MB). Free memory was 976.7 MB in the beginning and 1.5 GB in the end (delta: -504.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:33:19,754 INFO L168 Benchmark]: Witness Printer took 139.40 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:19,756 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 565.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -196.2 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 104.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 124.07 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1661.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 976.7 MB in the end (delta: 146.8 MB). Peak memory consumption was 146.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16057.68 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 390.1 MB). Free memory was 976.7 MB in the beginning and 1.5 GB in the end (delta: -504.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 139.40 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 63]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L34] int FloppyThread ; [L35] int KernelMode ; [L36] int Suspended ; [L37] int Executive ; [L38] int DiskController ; [L39] int FloppyDiskPeripheral ; [L40] int FlConfigCallBack ; [L41] int MaximumInterfaceType ; [L42] int MOUNTDEV_MOUNTED_DEVICE_GUID ; [L43] int myStatus ; [L44] int s ; [L45] int UNLOADED ; [L46] int NP ; [L47] int DC ; [L48] int SKIP1 ; [L49] int SKIP2 ; [L50] int MPR1 ; [L51] int MPR3 ; [L52] int IPC ; [L53] int pended ; [L54] int compRegistered ; [L55] int lowerDriverReturn ; [L56] int setEventCalled ; [L57] int customIrp ; [L89] int PagingReferenceCount = 0; [L90] int PagingMutex = 0; VAL [compRegistered=0, customIrp=0, DC=0, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=0, MPR3=0, myStatus=0, NP=0, PagingMutex=0, PagingReferenceCount=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=0, UNLOADED=0] [L669] int status ; [L670] int irp = __VERIFIER_nondet_int() ; [L671] int pirp ; [L672] int pirp__IoStatus__Status ; [L673] int irp_choice = __VERIFIER_nondet_int() ; [L674] int devobj = __VERIFIER_nondet_int() ; [L675] int __cil_tmp8 ; [L677] FloppyThread = 0 [L678] KernelMode = 0 [L679] Suspended = 0 [L680] Executive = 0 [L681] DiskController = 0 [L682] FloppyDiskPeripheral = 0 [L683] FlConfigCallBack = 0 [L684] MaximumInterfaceType = 0 [L685] MOUNTDEV_MOUNTED_DEVICE_GUID = 0 [L686] myStatus = 0 [L687] s = 0 [L688] UNLOADED = 0 [L689] NP = 0 [L690] DC = 0 [L691] SKIP1 = 0 [L692] SKIP2 = 0 [L693] MPR1 = 0 [L694] MPR3 = 0 [L695] IPC = 0 [L696] pended = 0 [L697] compRegistered = 0 [L698] lowerDriverReturn = 0 [L699] setEventCalled = 0 [L700] customIrp = 0 [L704] status = 0 [L705] pirp = irp [L72] UNLOADED = 0 [L73] NP = 1 [L74] DC = 2 [L75] SKIP1 = 3 [L76] SKIP2 = 4 [L77] MPR1 = 5 [L78] MPR3 = 6 [L79] IPC = 7 [L80] s = UNLOADED [L81] pended = 0 [L82] compRegistered = 0 [L83] lowerDriverReturn = 0 [L84] setEventCalled = 0 [L85] customIrp = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L708] COND TRUE status >= 0 [L709] s = NP [L710] customIrp = 0 [L711] setEventCalled = customIrp [L712] lowerDriverReturn = setEventCalled [L713] compRegistered = lowerDriverReturn [L714] pended = compRegistered [L715] pirp__IoStatus__Status = 0 [L716] myStatus = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L717] COND TRUE irp_choice == 0 [L718] pirp__IoStatus__Status = -1073741637 [L719] myStatus = -1073741637 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L659] s = NP [L660] pended = 0 [L661] compRegistered = 0 [L662] lowerDriverReturn = 0 [L663] setEventCalled = 0 [L664] customIrp = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L725] COND FALSE !(status < 0) [L729] int tmp_ndt_1; [L730] tmp_ndt_1 = __VERIFIER_nondet_int() [L731] COND TRUE tmp_ndt_1 == 3 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L162] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L163] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L164] int Irp__IoStatus__Information ; [L165] int Irp__IoStatus__Status ; [L166] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L167] int disketteExtension__IsRemoved = __VERIFIER_nondet_int() ; [L168] int disketteExtension__IsStarted = __VERIFIER_nondet_int() ; [L169] int disketteExtension__TargetObject = __VERIFIER_nondet_int() ; [L170] int disketteExtension__HoldNewRequests ; [L171] int disketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L172] int disketteExtension__InterfaceString__Buffer = __VERIFIER_nondet_int() ; [L173] int disketteExtension__InterfaceString = __VERIFIER_nondet_int() ; [L174] int disketteExtension__ArcName__Length = __VERIFIER_nondet_int() ; [L175] int disketteExtension__ArcName = __VERIFIER_nondet_int() ; [L176] int irpSp__MinorFunction = __VERIFIER_nondet_int() ; [L177] int IoGetConfigurationInformation__FloppyCount = __VERIFIER_nondet_int() ; [L178] int irpSp ; [L179] int disketteExtension ; [L180] int ntStatus ; [L181] int doneEvent = __VERIFIER_nondet_int() ; [L182] int irpSp___0 ; [L183] int nextIrpSp ; [L184] int nextIrpSp__Control ; [L185] int irpSp___1 ; [L186] int irpSp__Context ; [L187] int irpSp__Control ; [L188] long __cil_tmp29 ; [L189] long __cil_tmp30 ; [L192] ntStatus = 0 [L193] PagingReferenceCount ++ VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L194] COND TRUE PagingReferenceCount == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L197] disketteExtension = DeviceObject__DeviceExtension [L198] irpSp = Irp__Tail__Overlay__CurrentStackLocation VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L199] COND FALSE !(\read(disketteExtension__IsRemoved)) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L208] COND FALSE !(irpSp__MinorFunction == 0) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L211] COND TRUE irpSp__MinorFunction == 5 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L237] COND TRUE irpSp__MinorFunction == 5 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L240] COND FALSE !(! disketteExtension__IsStarted) [L256] disketteExtension__HoldNewRequests = 1 [L99] int status ; [L100] int threadHandle = __VERIFIER_nondet_int() ; [L101] int DisketteExtension__PoweringDown = __VERIFIER_nondet_int() ; [L102] int DisketteExtension__ThreadReferenceCount = __VERIFIER_nondet_int() ; [L103] int DisketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L104] int Irp__IoStatus__Status ; [L105] int Irp__IoStatus__Information ; [L106] int Irp__Tail__Overlay__CurrentStackLocation__Control ; [L107] int ObjAttributes = __VERIFIER_nondet_int() ; [L108] int __cil_tmp12 ; [L109] int __cil_tmp13 ; VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L112] COND FALSE !(DisketteExtension__PoweringDown == 1) [L118] DisketteExtension__ThreadReferenceCount ++ VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L119] COND FALSE !(DisketteExtension__ThreadReferenceCount == 0) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L151] COND TRUE pended == 0 [L152] pended = 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L158] return (259); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L257] ntStatus = FlQueueIrpToThread(Irp, disketteExtension) [L260] __cil_tmp29 = (long )ntStatus VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L261] COND TRUE __cil_tmp29 == 259L [L1034] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1043] COND FALSE !(customIrp == 1) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1047] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1054] int tmp_ndt_8; [L1055] tmp_ndt_8 = __VERIFIER_nondet_int() [L1056] COND TRUE tmp_ndt_8 == 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1062] return (0); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L266] COND TRUE disketteExtension__FloppyThread != 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L269] disketteExtension__FloppyThread = 0 [L270] Irp__IoStatus__Status = 0 [L271] myStatus = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L272] COND TRUE s == NP [L273] s = SKIP1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L280] Irp__CurrentLocation ++ [L281] Irp__Tail__Overlay__CurrentStackLocation ++ [L936] int returnVal2 ; [L937] int compRetStatus1 ; [L938] int lcontext = __VERIFIER_nondet_int() ; [L939] unsigned long __cil_tmp7 ; VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L942] COND FALSE !(\read(compRegistered)) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L955] int tmp_ndt_12; [L956] tmp_ndt_12 = __VERIFIER_nondet_int() [L957] COND TRUE tmp_ndt_12 == 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L968] returnVal2 = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L981] COND FALSE !(s == NP) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L985] COND FALSE !(s == MPR1) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L994] COND TRUE s == SKIP1 [L995] s = SKIP2 [L996] lowerDriverReturn = returnVal2 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1004] return (returnVal2); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L282] ntStatus = IofCallDriver(disketteExtension__TargetObject, Irp) [L428] PagingReferenceCount -- VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L429] COND TRUE PagingReferenceCount == 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L432] return (ntStatus); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L738] status = FloppyPnp(devobj, pirp) [L748] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L749] COND FALSE !(s == NP) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L756] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L757] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L764] COND TRUE s != UNLOADED VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L765] COND TRUE status != -1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L766] COND FALSE !(s != SKIP2) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L780] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L781] COND TRUE status != 259 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L63] __VERIFIER_error() VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 421 locations, 41 error locations. Result: UNSAFE, OverallTime: 15.9s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 16984 SDtfs, 13228 SDslu, 25141 SDs, 0 SdLazy, 4888 SolverSat, 501 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=670occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 39 MinimizatonAttempts, 3014 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1344 NumberOfCodeBlocks, 1344 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1250 ConstructedInterpolants, 0 QuantifiedInterpolants, 109920 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...