./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 579bc16896f0e20e11afe49ee7ceb82dfd52b156 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-30f4e4a [2019-11-27 22:35:01,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:35:01,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:35:01,303 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:35:01,304 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:35:01,306 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:35:01,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:35:01,318 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:35:01,323 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:35:01,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:35:01,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:35:01,329 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:35:01,329 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:35:01,332 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:35:01,335 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:35:01,336 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:35:01,338 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:35:01,339 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:35:01,341 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:35:01,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:35:01,349 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:35:01,354 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:35:01,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:35:01,356 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:35:01,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:35:01,359 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:35:01,359 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:35:01,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:35:01,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:35:01,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:35:01,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:35:01,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:35:01,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:35:01,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:35:01,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:35:01,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:35:01,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:35:01,368 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:35:01,368 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:35:01,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:35:01,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:35:01,371 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:35:01,393 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:35:01,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:35:01,394 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:35:01,394 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:35:01,394 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:35:01,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:35:01,395 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:35:01,395 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:35:01,395 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:35:01,396 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:35:01,400 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:35:01,400 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:35:01,400 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:35:01,400 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:35:01,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:35:01,401 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:35:01,401 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:35:01,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:35:01,401 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:35:01,402 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:35:01,402 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:35:01,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:35:01,402 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:35:01,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:35:01,403 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:35:01,403 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:35:01,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:35:01,404 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:35:01,404 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 579bc16896f0e20e11afe49ee7ceb82dfd52b156 [2019-11-27 22:35:01,703 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:35:01,717 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:35:01,720 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:35:01,722 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:35:01,722 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:35:01,723 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c [2019-11-27 22:35:01,795 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb4d17d5f/20a1b66894ca48008ce95a34c6e455cc/FLAG066e3cbfb [2019-11-27 22:35:02,303 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:35:02,307 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c [2019-11-27 22:35:02,332 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb4d17d5f/20a1b66894ca48008ce95a34c6e455cc/FLAG066e3cbfb [2019-11-27 22:35:02,607 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb4d17d5f/20a1b66894ca48008ce95a34c6e455cc [2019-11-27 22:35:02,611 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:35:02,613 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:35:02,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:02,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:35:02,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:35:02,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:02" (1/1) ... [2019-11-27 22:35:02,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b3eb5ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:02, skipping insertion in model container [2019-11-27 22:35:02,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:02" (1/1) ... [2019-11-27 22:35:02,632 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:35:02,705 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:35:03,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:03,166 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:35:03,278 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:03,303 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:35:03,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:03 WrapperNode [2019-11-27 22:35:03,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:03,304 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:03,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:35:03,305 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:35:03,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:03" (1/1) ... [2019-11-27 22:35:03,330 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:03" (1/1) ... [2019-11-27 22:35:03,419 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:03,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:35:03,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:35:03,420 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:35:03,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:03" (1/1) ... [2019-11-27 22:35:03,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:03" (1/1) ... [2019-11-27 22:35:03,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:03" (1/1) ... [2019-11-27 22:35:03,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:03" (1/1) ... [2019-11-27 22:35:03,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:03" (1/1) ... [2019-11-27 22:35:03,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:03" (1/1) ... [2019-11-27 22:35:03,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:03" (1/1) ... [2019-11-27 22:35:03,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:35:03,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:35:03,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:35:03,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:35:03,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-27 22:35:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:35:03,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:35:03,967 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:03,999 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,007 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,014 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,015 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,016 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,022 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,030 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,035 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,038 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,039 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,041 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,043 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,047 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,049 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,049 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,051 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,053 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,054 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,054 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,056 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,057 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,061 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,066 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,068 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,069 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,071 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,072 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,073 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:04,075 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:05,282 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##658: assume !false; [2019-11-27 22:35:05,282 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##657: assume false; [2019-11-27 22:35:05,283 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##665: assume !false; [2019-11-27 22:35:05,283 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##664: assume false; [2019-11-27 22:35:05,284 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##683: assume false; [2019-11-27 22:35:05,284 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume !false; [2019-11-27 22:35:05,284 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2019-11-27 22:35:05,284 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2019-11-27 22:35:05,285 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume false; [2019-11-27 22:35:05,285 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##640: assume !false; [2019-11-27 22:35:05,286 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2019-11-27 22:35:05,286 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2019-11-27 22:35:05,286 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2019-11-27 22:35:05,286 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2019-11-27 22:35:05,287 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume !false; [2019-11-27 22:35:05,287 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##284: assume false; [2019-11-27 22:35:05,287 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##229: assume !false; [2019-11-27 22:35:05,287 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##228: assume false; [2019-11-27 22:35:05,288 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2019-11-27 22:35:05,288 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2019-11-27 22:35:05,289 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##369: assume !false; [2019-11-27 22:35:05,289 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##375: assume !false; [2019-11-27 22:35:05,289 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##374: assume false; [2019-11-27 22:35:05,290 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2019-11-27 22:35:05,290 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2019-11-27 22:35:05,290 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##357: assume false; [2019-11-27 22:35:05,291 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##358: assume !false; [2019-11-27 22:35:05,291 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##368: assume false; [2019-11-27 22:35:05,291 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##404: assume !false; [2019-11-27 22:35:05,292 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##403: assume false; [2019-11-27 22:35:05,292 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume !false; [2019-11-27 22:35:05,292 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##426: assume false; [2019-11-27 22:35:05,293 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##436: assume !false; [2019-11-27 22:35:05,293 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##435: assume false; [2019-11-27 22:35:05,294 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##439: assume false; [2019-11-27 22:35:05,294 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##440: assume !false; [2019-11-27 22:35:05,296 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2019-11-27 22:35:05,296 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2019-11-27 22:35:05,302 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##485: assume !false; [2019-11-27 22:35:05,302 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##484: assume false; [2019-11-27 22:35:05,303 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##524: assume !false; [2019-11-27 22:35:05,303 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##523: assume false; [2019-11-27 22:35:05,303 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##558: assume !false; [2019-11-27 22:35:05,303 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##557: assume false; [2019-11-27 22:35:05,304 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume !false; [2019-11-27 22:35:05,304 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##186: assume false; [2019-11-27 22:35:05,304 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##68: assume !false; [2019-11-27 22:35:05,305 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume false; [2019-11-27 22:35:05,305 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##144: assume false; [2019-11-27 22:35:05,305 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##145: assume !false; [2019-11-27 22:35:05,305 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2019-11-27 22:35:05,306 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2019-11-27 22:35:05,306 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##154: assume !false; [2019-11-27 22:35:05,306 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume false; [2019-11-27 22:35:05,306 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2019-11-27 22:35:05,307 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2019-11-27 22:35:05,307 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##588: assume !false; [2019-11-27 22:35:05,307 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##587: assume false; [2019-11-27 22:35:05,307 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2019-11-27 22:35:05,307 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2019-11-27 22:35:05,318 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:35:05,318 INFO L297 CfgBuilder]: Removed 277 assume(true) statements. [2019-11-27 22:35:05,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:05 BoogieIcfgContainer [2019-11-27 22:35:05,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:35:05,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:35:05,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:35:05,327 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:35:05,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:35:02" (1/3) ... [2019-11-27 22:35:05,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dabac09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:05, skipping insertion in model container [2019-11-27 22:35:05,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:03" (2/3) ... [2019-11-27 22:35:05,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dabac09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:05, skipping insertion in model container [2019-11-27 22:35:05,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:05" (3/3) ... [2019-11-27 22:35:05,332 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-1.c [2019-11-27 22:35:05,340 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:35:05,346 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 54 error locations. [2019-11-27 22:35:05,358 INFO L249 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2019-11-27 22:35:05,387 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:35:05,388 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:35:05,388 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:35:05,388 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:35:05,388 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:35:05,388 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:35:05,388 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:35:05,388 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:35:05,428 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states. [2019-11-27 22:35:05,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 22:35:05,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:05,436 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:05,437 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:05,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:05,444 INFO L82 PathProgramCache]: Analyzing trace with hash 538056098, now seen corresponding path program 1 times [2019-11-27 22:35:05,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:05,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740416936] [2019-11-27 22:35:05,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:05,655 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-27 22:35:05,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740416936] [2019-11-27 22:35:05,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:05,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:05,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408088922] [2019-11-27 22:35:05,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:05,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:05,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:05,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:05,678 INFO L87 Difference]: Start difference. First operand 572 states. Second operand 3 states. [2019-11-27 22:35:06,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:06,110 INFO L93 Difference]: Finished difference Result 1136 states and 1626 transitions. [2019-11-27 22:35:06,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:06,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-27 22:35:06,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:06,136 INFO L225 Difference]: With dead ends: 1136 [2019-11-27 22:35:06,136 INFO L226 Difference]: Without dead ends: 692 [2019-11-27 22:35:06,145 INFO L630 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-27 22:35:06,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-11-27 22:35:06,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 666. [2019-11-27 22:35:06,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-11-27 22:35:06,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 905 transitions. [2019-11-27 22:35:06,285 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 905 transitions. Word has length 10 [2019-11-27 22:35:06,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:06,285 INFO L462 AbstractCegarLoop]: Abstraction has 666 states and 905 transitions. [2019-11-27 22:35:06,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:06,286 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 905 transitions. [2019-11-27 22:35:06,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-27 22:35:06,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:06,287 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:06,287 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:06,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:06,289 INFO L82 PathProgramCache]: Analyzing trace with hash 369677969, now seen corresponding path program 1 times [2019-11-27 22:35:06,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:06,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101301279] [2019-11-27 22:35:06,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:06,338 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-27 22:35:06,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101301279] [2019-11-27 22:35:06,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:06,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:06,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411924598] [2019-11-27 22:35:06,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:06,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:06,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:06,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:06,342 INFO L87 Difference]: Start difference. First operand 666 states and 905 transitions. Second operand 3 states. [2019-11-27 22:35:06,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:06,383 INFO L93 Difference]: Finished difference Result 688 states and 930 transitions. [2019-11-27 22:35:06,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:06,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-27 22:35:06,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:06,388 INFO L225 Difference]: With dead ends: 688 [2019-11-27 22:35:06,388 INFO L226 Difference]: Without dead ends: 666 [2019-11-27 22:35:06,389 INFO L630 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-27 22:35:06,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-11-27 22:35:06,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2019-11-27 22:35:06,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-11-27 22:35:06,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 904 transitions. [2019-11-27 22:35:06,438 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 904 transitions. Word has length 11 [2019-11-27 22:35:06,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:06,438 INFO L462 AbstractCegarLoop]: Abstraction has 666 states and 904 transitions. [2019-11-27 22:35:06,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:06,438 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 904 transitions. [2019-11-27 22:35:06,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 22:35:06,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:06,440 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:06,442 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:06,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:06,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1535696421, now seen corresponding path program 1 times [2019-11-27 22:35:06,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:06,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847583437] [2019-11-27 22:35:06,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:06,560 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-27 22:35:06,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847583437] [2019-11-27 22:35:06,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:06,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:06,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411815032] [2019-11-27 22:35:06,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:06,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:06,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:06,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:06,566 INFO L87 Difference]: Start difference. First operand 666 states and 904 transitions. Second operand 3 states. [2019-11-27 22:35:06,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:06,633 INFO L93 Difference]: Finished difference Result 762 states and 1022 transitions. [2019-11-27 22:35:06,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:06,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-27 22:35:06,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:06,637 INFO L225 Difference]: With dead ends: 762 [2019-11-27 22:35:06,637 INFO L226 Difference]: Without dead ends: 735 [2019-11-27 22:35:06,638 INFO L630 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-27 22:35:06,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-11-27 22:35:06,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 686. [2019-11-27 22:35:06,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-11-27 22:35:06,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 941 transitions. [2019-11-27 22:35:06,668 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 941 transitions. Word has length 16 [2019-11-27 22:35:06,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:06,668 INFO L462 AbstractCegarLoop]: Abstraction has 686 states and 941 transitions. [2019-11-27 22:35:06,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:06,668 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 941 transitions. [2019-11-27 22:35:06,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 22:35:06,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:06,672 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:06,673 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:06,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:06,673 INFO L82 PathProgramCache]: Analyzing trace with hash 107438083, now seen corresponding path program 1 times [2019-11-27 22:35:06,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:06,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838741827] [2019-11-27 22:35:06,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:06,753 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-27 22:35:06,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838741827] [2019-11-27 22:35:06,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:06,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:06,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165537984] [2019-11-27 22:35:06,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:06,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:06,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:06,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:06,756 INFO L87 Difference]: Start difference. First operand 686 states and 941 transitions. Second operand 3 states. [2019-11-27 22:35:06,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:06,992 INFO L93 Difference]: Finished difference Result 723 states and 987 transitions. [2019-11-27 22:35:06,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:06,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-27 22:35:06,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:06,997 INFO L225 Difference]: With dead ends: 723 [2019-11-27 22:35:06,997 INFO L226 Difference]: Without dead ends: 718 [2019-11-27 22:35:06,998 INFO L630 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-27 22:35:06,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-11-27 22:35:07,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 715. [2019-11-27 22:35:07,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-11-27 22:35:07,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 979 transitions. [2019-11-27 22:35:07,029 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 979 transitions. Word has length 19 [2019-11-27 22:35:07,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:07,029 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 979 transitions. [2019-11-27 22:35:07,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:07,030 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 979 transitions. [2019-11-27 22:35:07,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 22:35:07,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:07,031 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:07,032 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:07,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:07,032 INFO L82 PathProgramCache]: Analyzing trace with hash 98463890, now seen corresponding path program 1 times [2019-11-27 22:35:07,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:07,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041195668] [2019-11-27 22:35:07,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:07,104 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-27 22:35:07,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041195668] [2019-11-27 22:35:07,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:07,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:07,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86363343] [2019-11-27 22:35:07,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:07,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:07,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:07,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:07,107 INFO L87 Difference]: Start difference. First operand 715 states and 979 transitions. Second operand 3 states. [2019-11-27 22:35:07,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:07,201 INFO L93 Difference]: Finished difference Result 1230 states and 1671 transitions. [2019-11-27 22:35:07,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:07,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-27 22:35:07,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:07,206 INFO L225 Difference]: With dead ends: 1230 [2019-11-27 22:35:07,206 INFO L226 Difference]: Without dead ends: 858 [2019-11-27 22:35:07,208 INFO L630 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-27 22:35:07,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2019-11-27 22:35:07,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 697. [2019-11-27 22:35:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-11-27 22:35:07,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 955 transitions. [2019-11-27 22:35:07,241 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 955 transitions. Word has length 19 [2019-11-27 22:35:07,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:07,241 INFO L462 AbstractCegarLoop]: Abstraction has 697 states and 955 transitions. [2019-11-27 22:35:07,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:07,241 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 955 transitions. [2019-11-27 22:35:07,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-27 22:35:07,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:07,242 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:07,243 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:07,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:07,243 INFO L82 PathProgramCache]: Analyzing trace with hash -946806949, now seen corresponding path program 1 times [2019-11-27 22:35:07,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:07,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422077214] [2019-11-27 22:35:07,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:07,306 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-27 22:35:07,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422077214] [2019-11-27 22:35:07,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:07,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:35:07,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297946591] [2019-11-27 22:35:07,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:35:07,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:07,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:35:07,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:35:07,309 INFO L87 Difference]: Start difference. First operand 697 states and 955 transitions. Second operand 4 states. [2019-11-27 22:35:07,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:07,381 INFO L93 Difference]: Finished difference Result 709 states and 968 transitions. [2019-11-27 22:35:07,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:35:07,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-27 22:35:07,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:07,385 INFO L225 Difference]: With dead ends: 709 [2019-11-27 22:35:07,385 INFO L226 Difference]: Without dead ends: 689 [2019-11-27 22:35:07,386 INFO L630 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-27 22:35:07,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-11-27 22:35:07,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2019-11-27 22:35:07,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-11-27 22:35:07,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 945 transitions. [2019-11-27 22:35:07,422 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 945 transitions. Word has length 20 [2019-11-27 22:35:07,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:07,422 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 945 transitions. [2019-11-27 22:35:07,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:35:07,422 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 945 transitions. [2019-11-27 22:35:07,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 22:35:07,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:07,423 INFO L410 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-27 22:35:07,424 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:07,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:07,424 INFO L82 PathProgramCache]: Analyzing trace with hash 2136813194, now seen corresponding path program 1 times [2019-11-27 22:35:07,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:07,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098113246] [2019-11-27 22:35:07,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:07,465 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-27 22:35:07,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098113246] [2019-11-27 22:35:07,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:07,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:07,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035831234] [2019-11-27 22:35:07,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:07,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:07,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:07,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:07,468 INFO L87 Difference]: Start difference. First operand 689 states and 945 transitions. Second operand 3 states. [2019-11-27 22:35:07,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:07,674 INFO L93 Difference]: Finished difference Result 689 states and 945 transitions. [2019-11-27 22:35:07,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:07,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-27 22:35:07,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:07,678 INFO L225 Difference]: With dead ends: 689 [2019-11-27 22:35:07,680 INFO L226 Difference]: Without dead ends: 673 [2019-11-27 22:35:07,681 INFO L630 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-27 22:35:07,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-11-27 22:35:07,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2019-11-27 22:35:07,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-11-27 22:35:07,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 928 transitions. [2019-11-27 22:35:07,715 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 928 transitions. Word has length 23 [2019-11-27 22:35:07,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:07,716 INFO L462 AbstractCegarLoop]: Abstraction has 673 states and 928 transitions. [2019-11-27 22:35:07,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:07,716 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 928 transitions. [2019-11-27 22:35:07,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 22:35:07,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:07,718 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:07,719 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:07,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:07,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1059387616, now seen corresponding path program 1 times [2019-11-27 22:35:07,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:07,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393219051] [2019-11-27 22:35:07,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:07,777 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-27 22:35:07,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393219051] [2019-11-27 22:35:07,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:07,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:35:07,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528254862] [2019-11-27 22:35:07,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:35:07,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:07,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:35:07,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:35:07,781 INFO L87 Difference]: Start difference. First operand 673 states and 928 transitions. Second operand 4 states. [2019-11-27 22:35:07,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:07,841 INFO L93 Difference]: Finished difference Result 686 states and 942 transitions. [2019-11-27 22:35:07,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:35:07,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-27 22:35:07,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:07,846 INFO L225 Difference]: With dead ends: 686 [2019-11-27 22:35:07,846 INFO L226 Difference]: Without dead ends: 671 [2019-11-27 22:35:07,847 INFO L630 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-27 22:35:07,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-11-27 22:35:07,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2019-11-27 22:35:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2019-11-27 22:35:07,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 925 transitions. [2019-11-27 22:35:07,882 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 925 transitions. Word has length 24 [2019-11-27 22:35:07,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:07,884 INFO L462 AbstractCegarLoop]: Abstraction has 671 states and 925 transitions. [2019-11-27 22:35:07,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:35:07,885 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 925 transitions. [2019-11-27 22:35:07,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 22:35:07,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:07,886 INFO L410 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-27 22:35:07,887 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:07,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:07,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1371761021, now seen corresponding path program 1 times [2019-11-27 22:35:07,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:07,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029202838] [2019-11-27 22:35:07,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:07,922 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-27 22:35:07,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029202838] [2019-11-27 22:35:07,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:07,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:07,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447701909] [2019-11-27 22:35:07,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:07,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:07,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:07,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:07,925 INFO L87 Difference]: Start difference. First operand 671 states and 925 transitions. Second operand 3 states. [2019-11-27 22:35:08,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:08,141 INFO L93 Difference]: Finished difference Result 873 states and 1195 transitions. [2019-11-27 22:35:08,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:08,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-27 22:35:08,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:08,146 INFO L225 Difference]: With dead ends: 873 [2019-11-27 22:35:08,146 INFO L226 Difference]: Without dead ends: 865 [2019-11-27 22:35:08,147 INFO L630 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-27 22:35:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-11-27 22:35:08,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 689. [2019-11-27 22:35:08,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-11-27 22:35:08,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 952 transitions. [2019-11-27 22:35:08,191 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 952 transitions. Word has length 25 [2019-11-27 22:35:08,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:08,192 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 952 transitions. [2019-11-27 22:35:08,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:08,192 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 952 transitions. [2019-11-27 22:35:08,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 22:35:08,194 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:08,195 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:08,196 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:08,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:08,196 INFO L82 PathProgramCache]: Analyzing trace with hash 417423376, now seen corresponding path program 1 times [2019-11-27 22:35:08,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:08,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445262158] [2019-11-27 22:35:08,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:08,269 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-27 22:35:08,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445262158] [2019-11-27 22:35:08,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:08,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-27 22:35:08,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858786231] [2019-11-27 22:35:08,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 22:35:08,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:08,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 22:35:08,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-27 22:35:08,272 INFO L87 Difference]: Start difference. First operand 689 states and 952 transitions. Second operand 7 states. [2019-11-27 22:35:08,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:08,952 INFO L93 Difference]: Finished difference Result 1033 states and 1388 transitions. [2019-11-27 22:35:08,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 22:35:08,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-27 22:35:08,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:08,957 INFO L225 Difference]: With dead ends: 1033 [2019-11-27 22:35:08,957 INFO L226 Difference]: Without dead ends: 774 [2019-11-27 22:35:08,960 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-27 22:35:08,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-11-27 22:35:08,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 672. [2019-11-27 22:35:08,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2019-11-27 22:35:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 916 transitions. [2019-11-27 22:35:09,000 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 916 transitions. Word has length 26 [2019-11-27 22:35:09,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:09,000 INFO L462 AbstractCegarLoop]: Abstraction has 672 states and 916 transitions. [2019-11-27 22:35:09,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 22:35:09,001 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 916 transitions. [2019-11-27 22:35:09,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 22:35:09,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:09,008 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:09,008 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:09,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:09,009 INFO L82 PathProgramCache]: Analyzing trace with hash -65568844, now seen corresponding path program 1 times [2019-11-27 22:35:09,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:09,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452461517] [2019-11-27 22:35:09,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:09,041 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-27 22:35:09,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452461517] [2019-11-27 22:35:09,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:09,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:35:09,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014463558] [2019-11-27 22:35:09,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:35:09,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:09,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:35:09,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:35:09,043 INFO L87 Difference]: Start difference. First operand 672 states and 916 transitions. Second operand 4 states. [2019-11-27 22:35:09,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:09,099 INFO L93 Difference]: Finished difference Result 685 states and 930 transitions. [2019-11-27 22:35:09,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:35:09,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-27 22:35:09,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:09,103 INFO L225 Difference]: With dead ends: 685 [2019-11-27 22:35:09,103 INFO L226 Difference]: Without dead ends: 670 [2019-11-27 22:35:09,104 INFO L630 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-27 22:35:09,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-11-27 22:35:09,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2019-11-27 22:35:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-11-27 22:35:09,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 913 transitions. [2019-11-27 22:35:09,139 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 913 transitions. Word has length 26 [2019-11-27 22:35:09,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:09,141 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 913 transitions. [2019-11-27 22:35:09,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:35:09,142 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 913 transitions. [2019-11-27 22:35:09,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-27 22:35:09,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:09,143 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:09,144 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:09,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:09,144 INFO L82 PathProgramCache]: Analyzing trace with hash 2044140679, now seen corresponding path program 1 times [2019-11-27 22:35:09,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:09,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34070610] [2019-11-27 22:35:09,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:09,186 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-27 22:35:09,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34070610] [2019-11-27 22:35:09,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:09,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:35:09,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501932077] [2019-11-27 22:35:09,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:35:09,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:09,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:35:09,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:35:09,189 INFO L87 Difference]: Start difference. First operand 670 states and 913 transitions. Second operand 4 states. [2019-11-27 22:35:09,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:09,259 INFO L93 Difference]: Finished difference Result 708 states and 954 transitions. [2019-11-27 22:35:09,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:35:09,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-27 22:35:09,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:09,263 INFO L225 Difference]: With dead ends: 708 [2019-11-27 22:35:09,263 INFO L226 Difference]: Without dead ends: 687 [2019-11-27 22:35:09,264 INFO L630 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-27 22:35:09,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-11-27 22:35:09,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 672. [2019-11-27 22:35:09,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2019-11-27 22:35:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 915 transitions. [2019-11-27 22:35:09,294 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 915 transitions. Word has length 27 [2019-11-27 22:35:09,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:09,295 INFO L462 AbstractCegarLoop]: Abstraction has 672 states and 915 transitions. [2019-11-27 22:35:09,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:35:09,295 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 915 transitions. [2019-11-27 22:35:09,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-27 22:35:09,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:09,297 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:09,298 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:09,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:09,298 INFO L82 PathProgramCache]: Analyzing trace with hash -610986493, now seen corresponding path program 1 times [2019-11-27 22:35:09,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:09,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98580441] [2019-11-27 22:35:09,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:09,343 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-27 22:35:09,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98580441] [2019-11-27 22:35:09,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:09,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:09,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23707671] [2019-11-27 22:35:09,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:09,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:09,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:09,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:09,348 INFO L87 Difference]: Start difference. First operand 672 states and 915 transitions. Second operand 3 states. [2019-11-27 22:35:09,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:09,396 INFO L93 Difference]: Finished difference Result 703 states and 951 transitions. [2019-11-27 22:35:09,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:09,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-27 22:35:09,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:09,400 INFO L225 Difference]: With dead ends: 703 [2019-11-27 22:35:09,400 INFO L226 Difference]: Without dead ends: 661 [2019-11-27 22:35:09,401 INFO L630 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-27 22:35:09,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-11-27 22:35:09,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 658. [2019-11-27 22:35:09,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-27 22:35:09,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 891 transitions. [2019-11-27 22:35:09,435 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 891 transitions. Word has length 27 [2019-11-27 22:35:09,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:09,435 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 891 transitions. [2019-11-27 22:35:09,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:09,435 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 891 transitions. [2019-11-27 22:35:09,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-27 22:35:09,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:09,437 INFO L410 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-27 22:35:09,437 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:09,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:09,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1636712997, now seen corresponding path program 1 times [2019-11-27 22:35:09,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:09,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206134136] [2019-11-27 22:35:09,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:09,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:09,477 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-27 22:35:09,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206134136] [2019-11-27 22:35:09,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:09,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:35:09,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461780193] [2019-11-27 22:35:09,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:35:09,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:09,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:35:09,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:35:09,480 INFO L87 Difference]: Start difference. First operand 658 states and 891 transitions. Second operand 4 states. [2019-11-27 22:35:09,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:09,545 INFO L93 Difference]: Finished difference Result 696 states and 932 transitions. [2019-11-27 22:35:09,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:35:09,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-27 22:35:09,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:09,551 INFO L225 Difference]: With dead ends: 696 [2019-11-27 22:35:09,551 INFO L226 Difference]: Without dead ends: 675 [2019-11-27 22:35:09,552 INFO L630 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-27 22:35:09,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-11-27 22:35:09,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 658. [2019-11-27 22:35:09,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-27 22:35:09,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 891 transitions. [2019-11-27 22:35:09,583 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 891 transitions. Word has length 28 [2019-11-27 22:35:09,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:09,583 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 891 transitions. [2019-11-27 22:35:09,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:35:09,583 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 891 transitions. [2019-11-27 22:35:09,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 22:35:09,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:09,585 INFO L410 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-27 22:35:09,585 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:09,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:09,586 INFO L82 PathProgramCache]: Analyzing trace with hash 615538312, now seen corresponding path program 1 times [2019-11-27 22:35:09,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:09,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879045078] [2019-11-27 22:35:09,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:09,656 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-27 22:35:09,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879045078] [2019-11-27 22:35:09,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:09,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-27 22:35:09,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276145946] [2019-11-27 22:35:09,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 22:35:09,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:09,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 22:35:09,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:35:09,659 INFO L87 Difference]: Start difference. First operand 658 states and 891 transitions. Second operand 8 states. [2019-11-27 22:35:10,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:10,190 INFO L93 Difference]: Finished difference Result 680 states and 913 transitions. [2019-11-27 22:35:10,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 22:35:10,191 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-27 22:35:10,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:10,194 INFO L225 Difference]: With dead ends: 680 [2019-11-27 22:35:10,194 INFO L226 Difference]: Without dead ends: 675 [2019-11-27 22:35:10,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-27 22:35:10,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-11-27 22:35:10,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 668. [2019-11-27 22:35:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-11-27 22:35:10,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 901 transitions. [2019-11-27 22:35:10,228 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 901 transitions. Word has length 29 [2019-11-27 22:35:10,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:10,229 INFO L462 AbstractCegarLoop]: Abstraction has 668 states and 901 transitions. [2019-11-27 22:35:10,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 22:35:10,229 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 901 transitions. [2019-11-27 22:35:10,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-27 22:35:10,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:10,230 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:10,231 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:10,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:10,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1368856645, now seen corresponding path program 1 times [2019-11-27 22:35:10,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:10,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048135599] [2019-11-27 22:35:10,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:10,299 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-27 22:35:10,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048135599] [2019-11-27 22:35:10,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:10,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-27 22:35:10,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573587423] [2019-11-27 22:35:10,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 22:35:10,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:10,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 22:35:10,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:35:10,301 INFO L87 Difference]: Start difference. First operand 668 states and 901 transitions. Second operand 8 states. [2019-11-27 22:35:10,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:10,865 INFO L93 Difference]: Finished difference Result 680 states and 912 transitions. [2019-11-27 22:35:10,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 22:35:10,867 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-11-27 22:35:10,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:10,872 INFO L225 Difference]: With dead ends: 680 [2019-11-27 22:35:10,872 INFO L226 Difference]: Without dead ends: 675 [2019-11-27 22:35:10,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-27 22:35:10,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-11-27 22:35:10,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 669. [2019-11-27 22:35:10,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2019-11-27 22:35:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 902 transitions. [2019-11-27 22:35:10,930 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 902 transitions. Word has length 30 [2019-11-27 22:35:10,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:10,931 INFO L462 AbstractCegarLoop]: Abstraction has 669 states and 902 transitions. [2019-11-27 22:35:10,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 22:35:10,931 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 902 transitions. [2019-11-27 22:35:10,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-27 22:35:10,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:10,933 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:10,933 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:10,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:10,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1926759716, now seen corresponding path program 1 times [2019-11-27 22:35:10,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:10,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517947730] [2019-11-27 22:35:10,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:10,993 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-27 22:35:10,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517947730] [2019-11-27 22:35:10,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:10,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 22:35:10,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798910328] [2019-11-27 22:35:10,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:35:10,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:10,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:35:10,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:35:10,996 INFO L87 Difference]: Start difference. First operand 669 states and 902 transitions. Second operand 5 states. [2019-11-27 22:35:11,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:11,144 INFO L93 Difference]: Finished difference Result 684 states and 918 transitions. [2019-11-27 22:35:11,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:35:11,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-27 22:35:11,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:11,148 INFO L225 Difference]: With dead ends: 684 [2019-11-27 22:35:11,148 INFO L226 Difference]: Without dead ends: 667 [2019-11-27 22:35:11,149 INFO L630 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-27 22:35:11,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2019-11-27 22:35:11,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2019-11-27 22:35:11,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2019-11-27 22:35:11,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 897 transitions. [2019-11-27 22:35:11,188 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 897 transitions. Word has length 30 [2019-11-27 22:35:11,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:11,189 INFO L462 AbstractCegarLoop]: Abstraction has 667 states and 897 transitions. [2019-11-27 22:35:11,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:35:11,189 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 897 transitions. [2019-11-27 22:35:11,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-27 22:35:11,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:11,190 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:11,190 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:11,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:11,191 INFO L82 PathProgramCache]: Analyzing trace with hash 455234987, now seen corresponding path program 1 times [2019-11-27 22:35:11,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:11,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28475617] [2019-11-27 22:35:11,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:11,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-27 22:35:11,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28475617] [2019-11-27 22:35:11,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:11,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-27 22:35:11,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899577988] [2019-11-27 22:35:11,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 22:35:11,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:11,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 22:35:11,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-27 22:35:11,286 INFO L87 Difference]: Start difference. First operand 667 states and 897 transitions. Second operand 9 states. [2019-11-27 22:35:11,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:11,974 INFO L93 Difference]: Finished difference Result 693 states and 921 transitions. [2019-11-27 22:35:11,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 22:35:11,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-11-27 22:35:11,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:11,978 INFO L225 Difference]: With dead ends: 693 [2019-11-27 22:35:11,978 INFO L226 Difference]: Without dead ends: 684 [2019-11-27 22:35:11,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-11-27 22:35:11,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2019-11-27 22:35:12,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 667. [2019-11-27 22:35:12,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2019-11-27 22:35:12,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 895 transitions. [2019-11-27 22:35:12,015 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 895 transitions. Word has length 30 [2019-11-27 22:35:12,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:12,015 INFO L462 AbstractCegarLoop]: Abstraction has 667 states and 895 transitions. [2019-11-27 22:35:12,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 22:35:12,015 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 895 transitions. [2019-11-27 22:35:12,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-27 22:35:12,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:12,016 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:12,017 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:12,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:12,017 INFO L82 PathProgramCache]: Analyzing trace with hash -879074465, now seen corresponding path program 1 times [2019-11-27 22:35:12,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:12,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208628999] [2019-11-27 22:35:12,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:12,092 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-27 22:35:12,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208628999] [2019-11-27 22:35:12,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:12,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 22:35:12,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915545136] [2019-11-27 22:35:12,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:35:12,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:12,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:35:12,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:35:12,094 INFO L87 Difference]: Start difference. First operand 667 states and 895 transitions. Second operand 5 states. [2019-11-27 22:35:12,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:12,188 INFO L93 Difference]: Finished difference Result 673 states and 900 transitions. [2019-11-27 22:35:12,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:35:12,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-27 22:35:12,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:12,191 INFO L225 Difference]: With dead ends: 673 [2019-11-27 22:35:12,192 INFO L226 Difference]: Without dead ends: 650 [2019-11-27 22:35:12,192 INFO L630 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-27 22:35:12,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-11-27 22:35:12,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-11-27 22:35:12,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-11-27 22:35:12,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 866 transitions. [2019-11-27 22:35:12,223 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 866 transitions. Word has length 31 [2019-11-27 22:35:12,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:12,223 INFO L462 AbstractCegarLoop]: Abstraction has 650 states and 866 transitions. [2019-11-27 22:35:12,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:35:12,223 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 866 transitions. [2019-11-27 22:35:12,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-27 22:35:12,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:12,224 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:12,225 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:12,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:12,225 INFO L82 PathProgramCache]: Analyzing trace with hash 932056973, now seen corresponding path program 1 times [2019-11-27 22:35:12,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:12,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524511196] [2019-11-27 22:35:12,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:12,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:12,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524511196] [2019-11-27 22:35:12,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:12,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:12,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558688847] [2019-11-27 22:35:12,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:12,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:12,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:12,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:12,256 INFO L87 Difference]: Start difference. First operand 650 states and 866 transitions. Second operand 3 states. [2019-11-27 22:35:12,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:12,449 INFO L93 Difference]: Finished difference Result 839 states and 1102 transitions. [2019-11-27 22:35:12,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:12,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-27 22:35:12,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:12,453 INFO L225 Difference]: With dead ends: 839 [2019-11-27 22:35:12,453 INFO L226 Difference]: Without dead ends: 826 [2019-11-27 22:35:12,454 INFO L630 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-27 22:35:12,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2019-11-27 22:35:12,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 702. [2019-11-27 22:35:12,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-11-27 22:35:12,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 926 transitions. [2019-11-27 22:35:12,496 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 926 transitions. Word has length 31 [2019-11-27 22:35:12,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:12,496 INFO L462 AbstractCegarLoop]: Abstraction has 702 states and 926 transitions. [2019-11-27 22:35:12,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:12,496 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 926 transitions. [2019-11-27 22:35:12,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-27 22:35:12,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:12,498 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:12,498 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:12,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:12,498 INFO L82 PathProgramCache]: Analyzing trace with hash 694420866, now seen corresponding path program 1 times [2019-11-27 22:35:12,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:12,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093306356] [2019-11-27 22:35:12,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:12,606 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-27 22:35:12,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093306356] [2019-11-27 22:35:12,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:12,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-27 22:35:12,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845491027] [2019-11-27 22:35:12,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 22:35:12,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:12,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 22:35:12,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-27 22:35:12,609 INFO L87 Difference]: Start difference. First operand 702 states and 926 transitions. Second operand 9 states. [2019-11-27 22:35:13,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:13,258 INFO L93 Difference]: Finished difference Result 728 states and 949 transitions. [2019-11-27 22:35:13,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 22:35:13,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-27 22:35:13,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:13,261 INFO L225 Difference]: With dead ends: 728 [2019-11-27 22:35:13,262 INFO L226 Difference]: Without dead ends: 719 [2019-11-27 22:35:13,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-11-27 22:35:13,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-11-27 22:35:13,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 702. [2019-11-27 22:35:13,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-11-27 22:35:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 924 transitions. [2019-11-27 22:35:13,299 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 924 transitions. Word has length 31 [2019-11-27 22:35:13,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:13,300 INFO L462 AbstractCegarLoop]: Abstraction has 702 states and 924 transitions. [2019-11-27 22:35:13,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 22:35:13,300 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 924 transitions. [2019-11-27 22:35:13,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-27 22:35:13,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:13,302 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:13,302 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:13,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:13,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1700782205, now seen corresponding path program 1 times [2019-11-27 22:35:13,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:13,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663934077] [2019-11-27 22:35:13,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:13,334 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-27 22:35:13,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663934077] [2019-11-27 22:35:13,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:13,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:13,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586804606] [2019-11-27 22:35:13,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:13,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:13,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:13,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:13,336 INFO L87 Difference]: Start difference. First operand 702 states and 924 transitions. Second operand 3 states. [2019-11-27 22:35:13,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:13,538 INFO L93 Difference]: Finished difference Result 910 states and 1200 transitions. [2019-11-27 22:35:13,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:13,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-27 22:35:13,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:13,543 INFO L225 Difference]: With dead ends: 910 [2019-11-27 22:35:13,544 INFO L226 Difference]: Without dead ends: 704 [2019-11-27 22:35:13,544 INFO L630 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-27 22:35:13,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-11-27 22:35:13,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2019-11-27 22:35:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-11-27 22:35:13,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 927 transitions. [2019-11-27 22:35:13,578 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 927 transitions. Word has length 31 [2019-11-27 22:35:13,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:13,578 INFO L462 AbstractCegarLoop]: Abstraction has 704 states and 927 transitions. [2019-11-27 22:35:13,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:13,578 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 927 transitions. [2019-11-27 22:35:13,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 22:35:13,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:13,580 INFO L410 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-27 22:35:13,580 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:13,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:13,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1153413219, now seen corresponding path program 1 times [2019-11-27 22:35:13,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:13,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516761453] [2019-11-27 22:35:13,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:13,636 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-27 22:35:13,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516761453] [2019-11-27 22:35:13,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:13,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 22:35:13,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919898550] [2019-11-27 22:35:13,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 22:35:13,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:13,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 22:35:13,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:35:13,638 INFO L87 Difference]: Start difference. First operand 704 states and 927 transitions. Second operand 6 states. [2019-11-27 22:35:13,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:13,974 INFO L93 Difference]: Finished difference Result 764 states and 990 transitions. [2019-11-27 22:35:13,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 22:35:13,975 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-27 22:35:13,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:13,978 INFO L225 Difference]: With dead ends: 764 [2019-11-27 22:35:13,978 INFO L226 Difference]: Without dead ends: 761 [2019-11-27 22:35:13,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-27 22:35:13,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-11-27 22:35:14,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 717. [2019-11-27 22:35:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-11-27 22:35:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 943 transitions. [2019-11-27 22:35:14,016 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 943 transitions. Word has length 32 [2019-11-27 22:35:14,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:14,016 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 943 transitions. [2019-11-27 22:35:14,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 22:35:14,016 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 943 transitions. [2019-11-27 22:35:14,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 22:35:14,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:14,018 INFO L410 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-27 22:35:14,018 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:14,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:14,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1153425135, now seen corresponding path program 1 times [2019-11-27 22:35:14,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:14,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133377773] [2019-11-27 22:35:14,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:14,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-27 22:35:14,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133377773] [2019-11-27 22:35:14,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:14,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 22:35:14,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640669344] [2019-11-27 22:35:14,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 22:35:14,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:14,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 22:35:14,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:35:14,058 INFO L87 Difference]: Start difference. First operand 717 states and 943 transitions. Second operand 6 states. [2019-11-27 22:35:14,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:14,397 INFO L93 Difference]: Finished difference Result 1397 states and 1826 transitions. [2019-11-27 22:35:14,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 22:35:14,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-27 22:35:14,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:14,403 INFO L225 Difference]: With dead ends: 1397 [2019-11-27 22:35:14,403 INFO L226 Difference]: Without dead ends: 1103 [2019-11-27 22:35:14,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-27 22:35:14,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2019-11-27 22:35:14,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 768. [2019-11-27 22:35:14,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-11-27 22:35:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1014 transitions. [2019-11-27 22:35:14,445 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1014 transitions. Word has length 32 [2019-11-27 22:35:14,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:14,445 INFO L462 AbstractCegarLoop]: Abstraction has 768 states and 1014 transitions. [2019-11-27 22:35:14,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 22:35:14,445 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1014 transitions. [2019-11-27 22:35:14,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 22:35:14,446 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:14,447 INFO L410 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-27 22:35:14,447 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:14,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:14,447 INFO L82 PathProgramCache]: Analyzing trace with hash -311747134, now seen corresponding path program 1 times [2019-11-27 22:35:14,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:14,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232880472] [2019-11-27 22:35:14,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:14,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:14,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232880472] [2019-11-27 22:35:14,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:14,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 22:35:14,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524967046] [2019-11-27 22:35:14,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 22:35:14,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:14,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 22:35:14,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:35:14,496 INFO L87 Difference]: Start difference. First operand 768 states and 1014 transitions. Second operand 6 states. [2019-11-27 22:35:14,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:14,578 INFO L93 Difference]: Finished difference Result 781 states and 1026 transitions. [2019-11-27 22:35:14,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 22:35:14,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-27 22:35:14,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:14,581 INFO L225 Difference]: With dead ends: 781 [2019-11-27 22:35:14,582 INFO L226 Difference]: Without dead ends: 760 [2019-11-27 22:35:14,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-27 22:35:14,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-11-27 22:35:14,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2019-11-27 22:35:14,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-11-27 22:35:14,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1003 transitions. [2019-11-27 22:35:14,622 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1003 transitions. Word has length 32 [2019-11-27 22:35:14,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:14,622 INFO L462 AbstractCegarLoop]: Abstraction has 760 states and 1003 transitions. [2019-11-27 22:35:14,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 22:35:14,622 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1003 transitions. [2019-11-27 22:35:14,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 22:35:14,623 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:14,623 INFO L410 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-27 22:35:14,624 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:14,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:14,624 INFO L82 PathProgramCache]: Analyzing trace with hash -909472821, now seen corresponding path program 1 times [2019-11-27 22:35:14,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:14,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772114094] [2019-11-27 22:35:14,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:14,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772114094] [2019-11-27 22:35:14,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:14,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:14,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950618761] [2019-11-27 22:35:14,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:14,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:14,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:14,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:14,649 INFO L87 Difference]: Start difference. First operand 760 states and 1003 transitions. Second operand 3 states. [2019-11-27 22:35:14,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:14,704 INFO L93 Difference]: Finished difference Result 943 states and 1238 transitions. [2019-11-27 22:35:14,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:14,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-27 22:35:14,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:14,707 INFO L225 Difference]: With dead ends: 943 [2019-11-27 22:35:14,707 INFO L226 Difference]: Without dead ends: 736 [2019-11-27 22:35:14,708 INFO L630 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-27 22:35:14,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-11-27 22:35:14,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 720. [2019-11-27 22:35:14,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-27 22:35:14,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 945 transitions. [2019-11-27 22:35:14,751 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 945 transitions. Word has length 32 [2019-11-27 22:35:14,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:14,751 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 945 transitions. [2019-11-27 22:35:14,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:14,751 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 945 transitions. [2019-11-27 22:35:14,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-27 22:35:14,752 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:14,752 INFO L410 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-27 22:35:14,753 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:14,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:14,753 INFO L82 PathProgramCache]: Analyzing trace with hash -353842307, now seen corresponding path program 1 times [2019-11-27 22:35:14,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:14,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356071957] [2019-11-27 22:35:14,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:14,788 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-27 22:35:14,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356071957] [2019-11-27 22:35:14,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:14,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 22:35:14,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635701261] [2019-11-27 22:35:14,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:35:14,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:14,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:35:14,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:35:14,790 INFO L87 Difference]: Start difference. First operand 720 states and 945 transitions. Second operand 5 states. [2019-11-27 22:35:14,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:14,884 INFO L93 Difference]: Finished difference Result 853 states and 1095 transitions. [2019-11-27 22:35:14,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 22:35:14,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-27 22:35:14,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:14,888 INFO L225 Difference]: With dead ends: 853 [2019-11-27 22:35:14,888 INFO L226 Difference]: Without dead ends: 832 [2019-11-27 22:35:14,889 INFO L630 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-27 22:35:14,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2019-11-27 22:35:14,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 723. [2019-11-27 22:35:14,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-11-27 22:35:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 948 transitions. [2019-11-27 22:35:14,927 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 948 transitions. Word has length 33 [2019-11-27 22:35:14,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:14,927 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 948 transitions. [2019-11-27 22:35:14,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:35:14,927 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 948 transitions. [2019-11-27 22:35:14,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-27 22:35:14,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:14,928 INFO L410 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-27 22:35:14,929 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:14,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:14,929 INFO L82 PathProgramCache]: Analyzing trace with hash -56726392, now seen corresponding path program 1 times [2019-11-27 22:35:14,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:14,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651602786] [2019-11-27 22:35:14,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:14,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-27 22:35:14,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651602786] [2019-11-27 22:35:14,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:14,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:14,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978465027] [2019-11-27 22:35:14,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:14,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:14,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:14,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:14,954 INFO L87 Difference]: Start difference. First operand 723 states and 948 transitions. Second operand 3 states. [2019-11-27 22:35:15,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:15,123 INFO L93 Difference]: Finished difference Result 874 states and 1127 transitions. [2019-11-27 22:35:15,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:15,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-27 22:35:15,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:15,128 INFO L225 Difference]: With dead ends: 874 [2019-11-27 22:35:15,128 INFO L226 Difference]: Without dead ends: 839 [2019-11-27 22:35:15,129 INFO L630 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-27 22:35:15,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-11-27 22:35:15,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 776. [2019-11-27 22:35:15,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-11-27 22:35:15,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1005 transitions. [2019-11-27 22:35:15,189 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1005 transitions. Word has length 33 [2019-11-27 22:35:15,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:15,189 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1005 transitions. [2019-11-27 22:35:15,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:15,189 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1005 transitions. [2019-11-27 22:35:15,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-27 22:35:15,191 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:15,191 INFO L410 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-27 22:35:15,191 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:15,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:15,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1516001350, now seen corresponding path program 1 times [2019-11-27 22:35:15,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:15,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363068806] [2019-11-27 22:35:15,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:15,226 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-27 22:35:15,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363068806] [2019-11-27 22:35:15,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:15,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:35:15,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034316385] [2019-11-27 22:35:15,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:35:15,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:15,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:35:15,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:35:15,228 INFO L87 Difference]: Start difference. First operand 776 states and 1005 transitions. Second operand 4 states. [2019-11-27 22:35:15,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:15,470 INFO L93 Difference]: Finished difference Result 799 states and 1028 transitions. [2019-11-27 22:35:15,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:35:15,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-27 22:35:15,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:15,474 INFO L225 Difference]: With dead ends: 799 [2019-11-27 22:35:15,474 INFO L226 Difference]: Without dead ends: 688 [2019-11-27 22:35:15,475 INFO L630 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-27 22:35:15,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2019-11-27 22:35:15,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 674. [2019-11-27 22:35:15,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-11-27 22:35:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 860 transitions. [2019-11-27 22:35:15,581 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 860 transitions. Word has length 33 [2019-11-27 22:35:15,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:15,581 INFO L462 AbstractCegarLoop]: Abstraction has 674 states and 860 transitions. [2019-11-27 22:35:15,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:35:15,581 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 860 transitions. [2019-11-27 22:35:15,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-27 22:35:15,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:15,583 INFO L410 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-27 22:35:15,583 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:15,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:15,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1819476696, now seen corresponding path program 1 times [2019-11-27 22:35:15,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:15,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573763657] [2019-11-27 22:35:15,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:15,682 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-27 22:35:15,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573763657] [2019-11-27 22:35:15,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:15,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-27 22:35:15,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848054652] [2019-11-27 22:35:15,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 22:35:15,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:15,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 22:35:15,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-27 22:35:15,683 INFO L87 Difference]: Start difference. First operand 674 states and 860 transitions. Second operand 10 states. [2019-11-27 22:35:16,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:16,765 INFO L93 Difference]: Finished difference Result 776 states and 977 transitions. [2019-11-27 22:35:16,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 22:35:16,765 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-11-27 22:35:16,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:16,768 INFO L225 Difference]: With dead ends: 776 [2019-11-27 22:35:16,769 INFO L226 Difference]: Without dead ends: 760 [2019-11-27 22:35:16,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-11-27 22:35:16,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-11-27 22:35:16,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 676. [2019-11-27 22:35:16,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-11-27 22:35:16,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 862 transitions. [2019-11-27 22:35:16,813 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 862 transitions. Word has length 33 [2019-11-27 22:35:16,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:16,813 INFO L462 AbstractCegarLoop]: Abstraction has 676 states and 862 transitions. [2019-11-27 22:35:16,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 22:35:16,814 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 862 transitions. [2019-11-27 22:35:16,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-27 22:35:16,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:16,815 INFO L410 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-27 22:35:16,815 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:16,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:16,815 INFO L82 PathProgramCache]: Analyzing trace with hash -471504232, now seen corresponding path program 1 times [2019-11-27 22:35:16,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:16,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099596797] [2019-11-27 22:35:16,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:16,858 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-27 22:35:16,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099596797] [2019-11-27 22:35:16,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:16,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 22:35:16,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129842405] [2019-11-27 22:35:16,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:35:16,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:16,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:35:16,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:35:16,860 INFO L87 Difference]: Start difference. First operand 676 states and 862 transitions. Second operand 5 states. [2019-11-27 22:35:17,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:17,108 INFO L93 Difference]: Finished difference Result 690 states and 874 transitions. [2019-11-27 22:35:17,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:35:17,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-27 22:35:17,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:17,116 INFO L225 Difference]: With dead ends: 690 [2019-11-27 22:35:17,116 INFO L226 Difference]: Without dead ends: 674 [2019-11-27 22:35:17,117 INFO L630 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-27 22:35:17,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-11-27 22:35:17,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 665. [2019-11-27 22:35:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-11-27 22:35:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 848 transitions. [2019-11-27 22:35:17,150 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 848 transitions. Word has length 33 [2019-11-27 22:35:17,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:17,151 INFO L462 AbstractCegarLoop]: Abstraction has 665 states and 848 transitions. [2019-11-27 22:35:17,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:35:17,151 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 848 transitions. [2019-11-27 22:35:17,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-27 22:35:17,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:17,153 INFO L410 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-27 22:35:17,153 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:17,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:17,153 INFO L82 PathProgramCache]: Analyzing trace with hash -935530627, now seen corresponding path program 1 times [2019-11-27 22:35:17,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:17,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554240798] [2019-11-27 22:35:17,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:17,237 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-27 22:35:17,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554240798] [2019-11-27 22:35:17,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:17,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-27 22:35:17,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14416597] [2019-11-27 22:35:17,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 22:35:17,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:17,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 22:35:17,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-27 22:35:17,239 INFO L87 Difference]: Start difference. First operand 665 states and 848 transitions. Second operand 9 states. [2019-11-27 22:35:18,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:18,380 INFO L93 Difference]: Finished difference Result 1076 states and 1357 transitions. [2019-11-27 22:35:18,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 22:35:18,381 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-27 22:35:18,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:18,384 INFO L225 Difference]: With dead ends: 1076 [2019-11-27 22:35:18,385 INFO L226 Difference]: Without dead ends: 1053 [2019-11-27 22:35:18,385 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-11-27 22:35:18,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-11-27 22:35:18,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 663. [2019-11-27 22:35:18,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-11-27 22:35:18,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 844 transitions. [2019-11-27 22:35:18,434 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 844 transitions. Word has length 35 [2019-11-27 22:35:18,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:18,434 INFO L462 AbstractCegarLoop]: Abstraction has 663 states and 844 transitions. [2019-11-27 22:35:18,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 22:35:18,434 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 844 transitions. [2019-11-27 22:35:18,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-27 22:35:18,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:18,436 INFO L410 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-27 22:35:18,436 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:18,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:18,437 INFO L82 PathProgramCache]: Analyzing trace with hash 750020413, now seen corresponding path program 1 times [2019-11-27 22:35:18,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:18,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200342136] [2019-11-27 22:35:18,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:18,470 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-27 22:35:18,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200342136] [2019-11-27 22:35:18,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:18,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:35:18,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172003334] [2019-11-27 22:35:18,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:35:18,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:18,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:35:18,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:35:18,472 INFO L87 Difference]: Start difference. First operand 663 states and 844 transitions. Second operand 4 states. [2019-11-27 22:35:18,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:18,682 INFO L93 Difference]: Finished difference Result 728 states and 926 transitions. [2019-11-27 22:35:18,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:35:18,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-27 22:35:18,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:18,684 INFO L225 Difference]: With dead ends: 728 [2019-11-27 22:35:18,684 INFO L226 Difference]: Without dead ends: 691 [2019-11-27 22:35:18,685 INFO L630 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-27 22:35:18,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-11-27 22:35:18,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 631. [2019-11-27 22:35:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-11-27 22:35:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 808 transitions. [2019-11-27 22:35:18,716 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 808 transitions. Word has length 35 [2019-11-27 22:35:18,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:18,716 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 808 transitions. [2019-11-27 22:35:18,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:35:18,717 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 808 transitions. [2019-11-27 22:35:18,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-27 22:35:18,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:18,718 INFO L410 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-27 22:35:18,719 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:18,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:18,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1333490113, now seen corresponding path program 1 times [2019-11-27 22:35:18,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:18,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918109082] [2019-11-27 22:35:18,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:18,767 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-27 22:35:18,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918109082] [2019-11-27 22:35:18,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:18,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 22:35:18,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683219920] [2019-11-27 22:35:18,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:35:18,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:18,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:35:18,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:35:18,770 INFO L87 Difference]: Start difference. First operand 631 states and 808 transitions. Second operand 5 states. [2019-11-27 22:35:19,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:19,033 INFO L93 Difference]: Finished difference Result 1371 states and 1763 transitions. [2019-11-27 22:35:19,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 22:35:19,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-27 22:35:19,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:19,037 INFO L225 Difference]: With dead ends: 1371 [2019-11-27 22:35:19,037 INFO L226 Difference]: Without dead ends: 1185 [2019-11-27 22:35:19,038 INFO L630 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-27 22:35:19,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-11-27 22:35:19,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 638. [2019-11-27 22:35:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-11-27 22:35:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 815 transitions. [2019-11-27 22:35:19,078 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 815 transitions. Word has length 35 [2019-11-27 22:35:19,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:19,079 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 815 transitions. [2019-11-27 22:35:19,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:35:19,079 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 815 transitions. [2019-11-27 22:35:19,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 22:35:19,080 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:19,080 INFO L410 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-27 22:35:19,081 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:19,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:19,081 INFO L82 PathProgramCache]: Analyzing trace with hash -901089383, now seen corresponding path program 1 times [2019-11-27 22:35:19,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:19,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232460316] [2019-11-27 22:35:19,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:19,134 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-27 22:35:19,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232460316] [2019-11-27 22:35:19,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:19,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:19,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106552953] [2019-11-27 22:35:19,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:19,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:19,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:19,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:19,135 INFO L87 Difference]: Start difference. First operand 638 states and 815 transitions. Second operand 3 states. [2019-11-27 22:35:19,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:19,205 INFO L93 Difference]: Finished difference Result 898 states and 1150 transitions. [2019-11-27 22:35:19,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:19,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-27 22:35:19,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:19,209 INFO L225 Difference]: With dead ends: 898 [2019-11-27 22:35:19,209 INFO L226 Difference]: Without dead ends: 699 [2019-11-27 22:35:19,210 INFO L630 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-27 22:35:19,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-11-27 22:35:19,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 626. [2019-11-27 22:35:19,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-11-27 22:35:19,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 797 transitions. [2019-11-27 22:35:19,261 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 797 transitions. Word has length 36 [2019-11-27 22:35:19,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:19,261 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 797 transitions. [2019-11-27 22:35:19,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:19,262 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 797 transitions. [2019-11-27 22:35:19,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-27 22:35:19,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:19,263 INFO L410 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-27 22:35:19,264 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:19,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:19,264 INFO L82 PathProgramCache]: Analyzing trace with hash -307255467, now seen corresponding path program 1 times [2019-11-27 22:35:19,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:19,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266239840] [2019-11-27 22:35:19,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:19,324 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-27 22:35:19,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266239840] [2019-11-27 22:35:19,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:19,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 22:35:19,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723935648] [2019-11-27 22:35:19,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 22:35:19,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:19,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 22:35:19,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:35:19,325 INFO L87 Difference]: Start difference. First operand 626 states and 797 transitions. Second operand 6 states. [2019-11-27 22:35:19,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:19,477 INFO L93 Difference]: Finished difference Result 725 states and 904 transitions. [2019-11-27 22:35:19,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 22:35:19,478 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-11-27 22:35:19,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:19,491 INFO L225 Difference]: With dead ends: 725 [2019-11-27 22:35:19,496 INFO L226 Difference]: Without dead ends: 688 [2019-11-27 22:35:19,497 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-27 22:35:19,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2019-11-27 22:35:19,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 619. [2019-11-27 22:35:19,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-11-27 22:35:19,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 787 transitions. [2019-11-27 22:35:19,566 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 787 transitions. Word has length 37 [2019-11-27 22:35:19,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:19,567 INFO L462 AbstractCegarLoop]: Abstraction has 619 states and 787 transitions. [2019-11-27 22:35:19,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 22:35:19,567 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 787 transitions. [2019-11-27 22:35:19,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-27 22:35:19,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:19,569 INFO L410 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-27 22:35:19,570 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:19,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:19,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1515937655, now seen corresponding path program 1 times [2019-11-27 22:35:19,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:19,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603395578] [2019-11-27 22:35:19,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:19,613 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-27 22:35:19,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603395578] [2019-11-27 22:35:19,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:19,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 22:35:19,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238272600] [2019-11-27 22:35:19,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:35:19,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:19,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:35:19,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:35:19,619 INFO L87 Difference]: Start difference. First operand 619 states and 787 transitions. Second operand 5 states. [2019-11-27 22:35:19,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:19,731 INFO L93 Difference]: Finished difference Result 648 states and 815 transitions. [2019-11-27 22:35:19,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:35:19,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-11-27 22:35:19,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:19,740 INFO L225 Difference]: With dead ends: 648 [2019-11-27 22:35:19,741 INFO L226 Difference]: Without dead ends: 631 [2019-11-27 22:35:19,743 INFO L630 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-27 22:35:19,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-11-27 22:35:19,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 618. [2019-11-27 22:35:19,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-11-27 22:35:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 785 transitions. [2019-11-27 22:35:19,791 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 785 transitions. Word has length 37 [2019-11-27 22:35:19,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:19,791 INFO L462 AbstractCegarLoop]: Abstraction has 618 states and 785 transitions. [2019-11-27 22:35:19,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:35:19,792 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 785 transitions. [2019-11-27 22:35:19,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-27 22:35:19,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:19,798 INFO L410 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-27 22:35:19,798 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:19,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:19,801 INFO L82 PathProgramCache]: Analyzing trace with hash -604679938, now seen corresponding path program 1 times [2019-11-27 22:35:19,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:19,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800749257] [2019-11-27 22:35:19,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:19,843 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-27 22:35:19,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800749257] [2019-11-27 22:35:19,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:19,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 22:35:19,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538271213] [2019-11-27 22:35:19,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 22:35:19,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:19,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 22:35:19,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:35:19,844 INFO L87 Difference]: Start difference. First operand 618 states and 785 transitions. Second operand 6 states. [2019-11-27 22:35:20,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:20,058 INFO L93 Difference]: Finished difference Result 657 states and 821 transitions. [2019-11-27 22:35:20,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 22:35:20,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-11-27 22:35:20,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:20,059 INFO L225 Difference]: With dead ends: 657 [2019-11-27 22:35:20,060 INFO L226 Difference]: Without dead ends: 623 [2019-11-27 22:35:20,060 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-27 22:35:20,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-11-27 22:35:20,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 602. [2019-11-27 22:35:20,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-11-27 22:35:20,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 765 transitions. [2019-11-27 22:35:20,095 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 765 transitions. Word has length 37 [2019-11-27 22:35:20,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:20,095 INFO L462 AbstractCegarLoop]: Abstraction has 602 states and 765 transitions. [2019-11-27 22:35:20,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 22:35:20,096 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 765 transitions. [2019-11-27 22:35:20,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-27 22:35:20,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:20,097 INFO L410 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-27 22:35:20,098 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:20,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:20,098 INFO L82 PathProgramCache]: Analyzing trace with hash 48742328, now seen corresponding path program 1 times [2019-11-27 22:35:20,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:20,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753188884] [2019-11-27 22:35:20,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:20,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-27 22:35:20,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753188884] [2019-11-27 22:35:20,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:20,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:35:20,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325655385] [2019-11-27 22:35:20,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:35:20,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:20,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:35:20,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:35:20,211 INFO L87 Difference]: Start difference. First operand 602 states and 765 transitions. Second operand 4 states. [2019-11-27 22:35:20,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:20,344 INFO L93 Difference]: Finished difference Result 798 states and 1014 transitions. [2019-11-27 22:35:20,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:35:20,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-27 22:35:20,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:20,346 INFO L225 Difference]: With dead ends: 798 [2019-11-27 22:35:20,346 INFO L226 Difference]: Without dead ends: 579 [2019-11-27 22:35:20,347 INFO L630 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-27 22:35:20,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-11-27 22:35:20,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 567. [2019-11-27 22:35:20,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-11-27 22:35:20,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 714 transitions. [2019-11-27 22:35:20,420 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 714 transitions. Word has length 37 [2019-11-27 22:35:20,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:20,420 INFO L462 AbstractCegarLoop]: Abstraction has 567 states and 714 transitions. [2019-11-27 22:35:20,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:35:20,420 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 714 transitions. [2019-11-27 22:35:20,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-27 22:35:20,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:20,422 INFO L410 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-27 22:35:20,423 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:20,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:20,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1967560492, now seen corresponding path program 1 times [2019-11-27 22:35:20,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:20,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806285578] [2019-11-27 22:35:20,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:20,478 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-27 22:35:20,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806285578] [2019-11-27 22:35:20,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:20,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:35:20,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922376377] [2019-11-27 22:35:20,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:35:20,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:20,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:35:20,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:35:20,483 INFO L87 Difference]: Start difference. First operand 567 states and 714 transitions. Second operand 4 states. [2019-11-27 22:35:20,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:20,696 INFO L93 Difference]: Finished difference Result 748 states and 947 transitions. [2019-11-27 22:35:20,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:35:20,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-27 22:35:20,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:20,697 INFO L225 Difference]: With dead ends: 748 [2019-11-27 22:35:20,698 INFO L226 Difference]: Without dead ends: 564 [2019-11-27 22:35:20,698 INFO L630 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-27 22:35:20,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-11-27 22:35:20,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-11-27 22:35:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-11-27 22:35:20,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 705 transitions. [2019-11-27 22:35:20,787 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 705 transitions. Word has length 38 [2019-11-27 22:35:20,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:20,787 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 705 transitions. [2019-11-27 22:35:20,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:35:20,788 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 705 transitions. [2019-11-27 22:35:20,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-27 22:35:20,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:20,789 INFO L410 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-27 22:35:20,790 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:20,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:20,790 INFO L82 PathProgramCache]: Analyzing trace with hash -436735014, now seen corresponding path program 1 times [2019-11-27 22:35:20,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:20,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576758038] [2019-11-27 22:35:20,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:20,847 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-27 22:35:20,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576758038] [2019-11-27 22:35:20,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:20,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 22:35:20,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152920385] [2019-11-27 22:35:20,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:35:20,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:20,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:35:20,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:35:20,850 INFO L87 Difference]: Start difference. First operand 564 states and 705 transitions. Second operand 5 states. [2019-11-27 22:35:20,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:20,986 INFO L93 Difference]: Finished difference Result 587 states and 725 transitions. [2019-11-27 22:35:20,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 22:35:20,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-27 22:35:20,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:20,989 INFO L225 Difference]: With dead ends: 587 [2019-11-27 22:35:20,989 INFO L226 Difference]: Without dead ends: 566 [2019-11-27 22:35:20,989 INFO L630 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-27 22:35:20,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-11-27 22:35:21,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 556. [2019-11-27 22:35:21,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-11-27 22:35:21,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 695 transitions. [2019-11-27 22:35:21,090 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 695 transitions. Word has length 41 [2019-11-27 22:35:21,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:21,090 INFO L462 AbstractCegarLoop]: Abstraction has 556 states and 695 transitions. [2019-11-27 22:35:21,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:35:21,090 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 695 transitions. [2019-11-27 22:35:21,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-27 22:35:21,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:21,092 INFO L410 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-27 22:35:21,157 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:21,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:21,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1643790660, now seen corresponding path program 1 times [2019-11-27 22:35:21,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:21,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159050064] [2019-11-27 22:35:21,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:21,205 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-27 22:35:21,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159050064] [2019-11-27 22:35:21,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:21,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:35:21,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912753997] [2019-11-27 22:35:21,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:35:21,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:21,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:35:21,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:35:21,207 INFO L87 Difference]: Start difference. First operand 556 states and 695 transitions. Second operand 4 states. [2019-11-27 22:35:21,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:21,297 INFO L93 Difference]: Finished difference Result 584 states and 724 transitions. [2019-11-27 22:35:21,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:35:21,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-11-27 22:35:21,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:21,299 INFO L225 Difference]: With dead ends: 584 [2019-11-27 22:35:21,299 INFO L226 Difference]: Without dead ends: 566 [2019-11-27 22:35:21,300 INFO L630 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-27 22:35:21,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-11-27 22:35:21,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 542. [2019-11-27 22:35:21,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-11-27 22:35:21,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 679 transitions. [2019-11-27 22:35:21,372 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 679 transitions. Word has length 41 [2019-11-27 22:35:21,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:21,372 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 679 transitions. [2019-11-27 22:35:21,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:35:21,373 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 679 transitions. [2019-11-27 22:35:21,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-27 22:35:21,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:21,374 INFO L410 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-27 22:35:21,375 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:21,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:21,375 INFO L82 PathProgramCache]: Analyzing trace with hash -147578755, now seen corresponding path program 1 times [2019-11-27 22:35:21,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:21,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727994369] [2019-11-27 22:35:21,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:21,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:21,401 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-27 22:35:21,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727994369] [2019-11-27 22:35:21,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:21,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:21,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453414188] [2019-11-27 22:35:21,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:21,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:21,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:21,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:21,403 INFO L87 Difference]: Start difference. First operand 542 states and 679 transitions. Second operand 3 states. [2019-11-27 22:35:21,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:21,581 INFO L93 Difference]: Finished difference Result 937 states and 1169 transitions. [2019-11-27 22:35:21,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:21,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-27 22:35:21,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:21,584 INFO L225 Difference]: With dead ends: 937 [2019-11-27 22:35:21,584 INFO L226 Difference]: Without dead ends: 756 [2019-11-27 22:35:21,584 INFO L630 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-27 22:35:21,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2019-11-27 22:35:21,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 545. [2019-11-27 22:35:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-11-27 22:35:21,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 682 transitions. [2019-11-27 22:35:21,646 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 682 transitions. Word has length 41 [2019-11-27 22:35:21,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:21,647 INFO L462 AbstractCegarLoop]: Abstraction has 545 states and 682 transitions. [2019-11-27 22:35:21,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:21,647 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 682 transitions. [2019-11-27 22:35:21,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-27 22:35:21,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:21,649 INFO L410 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-27 22:35:21,649 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:21,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:21,649 INFO L82 PathProgramCache]: Analyzing trace with hash 160458813, now seen corresponding path program 1 times [2019-11-27 22:35:21,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:21,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606518773] [2019-11-27 22:35:21,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:21,699 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-27 22:35:21,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606518773] [2019-11-27 22:35:21,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:21,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 22:35:21,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44928171] [2019-11-27 22:35:21,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:35:21,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:21,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:35:21,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:35:21,700 INFO L87 Difference]: Start difference. First operand 545 states and 682 transitions. Second operand 5 states. [2019-11-27 22:35:21,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:21,936 INFO L93 Difference]: Finished difference Result 922 states and 1139 transitions. [2019-11-27 22:35:21,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 22:35:21,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-27 22:35:21,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:21,938 INFO L225 Difference]: With dead ends: 922 [2019-11-27 22:35:21,938 INFO L226 Difference]: Without dead ends: 766 [2019-11-27 22:35:21,939 INFO L630 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-27 22:35:21,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2019-11-27 22:35:21,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 545. [2019-11-27 22:35:21,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-11-27 22:35:21,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 678 transitions. [2019-11-27 22:35:21,995 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 678 transitions. Word has length 41 [2019-11-27 22:35:21,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:21,995 INFO L462 AbstractCegarLoop]: Abstraction has 545 states and 678 transitions. [2019-11-27 22:35:21,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:35:21,995 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 678 transitions. [2019-11-27 22:35:21,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-27 22:35:21,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:21,997 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:21,997 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:21,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:21,998 INFO L82 PathProgramCache]: Analyzing trace with hash -693628121, now seen corresponding path program 1 times [2019-11-27 22:35:21,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:21,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326807178] [2019-11-27 22:35:21,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:22,047 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-27 22:35:22,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326807178] [2019-11-27 22:35:22,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:22,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:35:22,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140746627] [2019-11-27 22:35:22,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:35:22,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:22,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:35:22,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:35:22,048 INFO L87 Difference]: Start difference. First operand 545 states and 678 transitions. Second operand 4 states. [2019-11-27 22:35:22,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:22,144 INFO L93 Difference]: Finished difference Result 794 states and 966 transitions. [2019-11-27 22:35:22,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:35:22,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-27 22:35:22,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:22,146 INFO L225 Difference]: With dead ends: 794 [2019-11-27 22:35:22,146 INFO L226 Difference]: Without dead ends: 707 [2019-11-27 22:35:22,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:35:22,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-11-27 22:35:22,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 549. [2019-11-27 22:35:22,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-11-27 22:35:22,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 682 transitions. [2019-11-27 22:35:22,190 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 682 transitions. Word has length 42 [2019-11-27 22:35:22,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:22,190 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 682 transitions. [2019-11-27 22:35:22,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:35:22,190 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 682 transitions. [2019-11-27 22:35:22,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-27 22:35:22,191 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:22,191 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:22,191 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:22,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:22,192 INFO L82 PathProgramCache]: Analyzing trace with hash -81749273, now seen corresponding path program 1 times [2019-11-27 22:35:22,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:22,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058048027] [2019-11-27 22:35:22,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:22,243 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-27 22:35:22,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058048027] [2019-11-27 22:35:22,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:22,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-27 22:35:22,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105697955] [2019-11-27 22:35:22,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 22:35:22,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:22,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 22:35:22,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-27 22:35:22,244 INFO L87 Difference]: Start difference. First operand 549 states and 682 transitions. Second operand 7 states. [2019-11-27 22:35:22,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:22,478 INFO L93 Difference]: Finished difference Result 777 states and 942 transitions. [2019-11-27 22:35:22,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 22:35:22,479 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-11-27 22:35:22,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:22,482 INFO L225 Difference]: With dead ends: 777 [2019-11-27 22:35:22,482 INFO L226 Difference]: Without dead ends: 619 [2019-11-27 22:35:22,483 INFO L630 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-27 22:35:22,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-11-27 22:35:22,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 552. [2019-11-27 22:35:22,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-11-27 22:35:22,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 683 transitions. [2019-11-27 22:35:22,570 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 683 transitions. Word has length 42 [2019-11-27 22:35:22,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:22,571 INFO L462 AbstractCegarLoop]: Abstraction has 552 states and 683 transitions. [2019-11-27 22:35:22,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 22:35:22,571 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 683 transitions. [2019-11-27 22:35:22,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-27 22:35:22,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:22,573 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:22,574 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:22,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:22,575 INFO L82 PathProgramCache]: Analyzing trace with hash -822982435, now seen corresponding path program 1 times [2019-11-27 22:35:22,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:22,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990198861] [2019-11-27 22:35:22,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:22,637 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-27 22:35:22,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990198861] [2019-11-27 22:35:22,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:22,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-27 22:35:22,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113362213] [2019-11-27 22:35:22,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 22:35:22,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:22,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 22:35:22,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-27 22:35:22,638 INFO L87 Difference]: Start difference. First operand 552 states and 683 transitions. Second operand 7 states. [2019-11-27 22:35:22,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:22,994 INFO L93 Difference]: Finished difference Result 587 states and 716 transitions. [2019-11-27 22:35:22,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 22:35:22,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-11-27 22:35:22,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:22,996 INFO L225 Difference]: With dead ends: 587 [2019-11-27 22:35:22,996 INFO L226 Difference]: Without dead ends: 440 [2019-11-27 22:35:22,997 INFO L630 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-27 22:35:22,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-11-27 22:35:23,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 410. [2019-11-27 22:35:23,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-11-27 22:35:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 504 transitions. [2019-11-27 22:35:23,044 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 504 transitions. Word has length 42 [2019-11-27 22:35:23,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:23,044 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 504 transitions. [2019-11-27 22:35:23,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 22:35:23,045 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 504 transitions. [2019-11-27 22:35:23,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-27 22:35:23,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:23,046 INFO L410 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] [2019-11-27 22:35:23,047 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:23,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:23,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1536215993, now seen corresponding path program 1 times [2019-11-27 22:35:23,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:23,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785771895] [2019-11-27 22:35:23,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:23,112 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-27 22:35:23,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785771895] [2019-11-27 22:35:23,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:23,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 22:35:23,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802355816] [2019-11-27 22:35:23,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:35:23,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:23,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:35:23,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:35:23,115 INFO L87 Difference]: Start difference. First operand 410 states and 504 transitions. Second operand 5 states. [2019-11-27 22:35:23,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:23,365 INFO L93 Difference]: Finished difference Result 828 states and 1031 transitions. [2019-11-27 22:35:23,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 22:35:23,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-27 22:35:23,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:23,367 INFO L225 Difference]: With dead ends: 828 [2019-11-27 22:35:23,367 INFO L226 Difference]: Without dead ends: 698 [2019-11-27 22:35:23,369 INFO L630 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-27 22:35:23,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-11-27 22:35:23,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 410. [2019-11-27 22:35:23,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-11-27 22:35:23,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 503 transitions. [2019-11-27 22:35:23,419 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 503 transitions. Word has length 44 [2019-11-27 22:35:23,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:23,419 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 503 transitions. [2019-11-27 22:35:23,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:35:23,419 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 503 transitions. [2019-11-27 22:35:23,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-27 22:35:23,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:23,421 INFO L410 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] [2019-11-27 22:35:23,421 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:23,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:23,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1966977471, now seen corresponding path program 1 times [2019-11-27 22:35:23,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:23,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342549327] [2019-11-27 22:35:23,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:23,504 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-27 22:35:23,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342549327] [2019-11-27 22:35:23,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:23,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-27 22:35:23,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489932519] [2019-11-27 22:35:23,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 22:35:23,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:23,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 22:35:23,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:35:23,507 INFO L87 Difference]: Start difference. First operand 410 states and 503 transitions. Second operand 8 states. [2019-11-27 22:35:23,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:23,742 INFO L93 Difference]: Finished difference Result 425 states and 517 transitions. [2019-11-27 22:35:23,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 22:35:23,743 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-11-27 22:35:23,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:23,745 INFO L225 Difference]: With dead ends: 425 [2019-11-27 22:35:23,745 INFO L226 Difference]: Without dead ends: 402 [2019-11-27 22:35:23,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-27 22:35:23,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-11-27 22:35:23,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2019-11-27 22:35:23,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-11-27 22:35:23,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 493 transitions. [2019-11-27 22:35:23,790 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 493 transitions. Word has length 46 [2019-11-27 22:35:23,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:23,791 INFO L462 AbstractCegarLoop]: Abstraction has 402 states and 493 transitions. [2019-11-27 22:35:23,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 22:35:23,791 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 493 transitions. [2019-11-27 22:35:23,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-27 22:35:23,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:23,792 INFO L410 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] [2019-11-27 22:35:23,793 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:23,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:23,794 INFO L82 PathProgramCache]: Analyzing trace with hash -702658274, now seen corresponding path program 1 times [2019-11-27 22:35:23,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:23,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241811892] [2019-11-27 22:35:23,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:23,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-27 22:35:23,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241811892] [2019-11-27 22:35:23,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:23,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:35:23,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028923111] [2019-11-27 22:35:23,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:35:23,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:23,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:35:23,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:35:23,832 INFO L87 Difference]: Start difference. First operand 402 states and 493 transitions. Second operand 4 states. [2019-11-27 22:35:23,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:23,909 INFO L93 Difference]: Finished difference Result 507 states and 610 transitions. [2019-11-27 22:35:23,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:35:23,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-27 22:35:23,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:23,911 INFO L225 Difference]: With dead ends: 507 [2019-11-27 22:35:23,911 INFO L226 Difference]: Without dead ends: 464 [2019-11-27 22:35:23,911 INFO L630 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-27 22:35:23,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-11-27 22:35:23,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 401. [2019-11-27 22:35:23,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-11-27 22:35:23,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 491 transitions. [2019-11-27 22:35:23,973 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 491 transitions. Word has length 47 [2019-11-27 22:35:23,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:23,974 INFO L462 AbstractCegarLoop]: Abstraction has 401 states and 491 transitions. [2019-11-27 22:35:23,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:35:23,975 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 491 transitions. [2019-11-27 22:35:23,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-27 22:35:23,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:23,977 INFO L410 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] [2019-11-27 22:35:23,977 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:23,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:23,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1085716830, now seen corresponding path program 1 times [2019-11-27 22:35:23,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:23,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318001514] [2019-11-27 22:35:23,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:24,052 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-27 22:35:24,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318001514] [2019-11-27 22:35:24,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:24,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-27 22:35:24,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143925137] [2019-11-27 22:35:24,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 22:35:24,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:24,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 22:35:24,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-27 22:35:24,055 INFO L87 Difference]: Start difference. First operand 401 states and 491 transitions. Second operand 7 states. [2019-11-27 22:35:24,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:24,239 INFO L93 Difference]: Finished difference Result 481 states and 578 transitions. [2019-11-27 22:35:24,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 22:35:24,240 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-27 22:35:24,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:24,242 INFO L225 Difference]: With dead ends: 481 [2019-11-27 22:35:24,243 INFO L226 Difference]: Without dead ends: 394 [2019-11-27 22:35:24,244 INFO L630 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-27 22:35:24,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-11-27 22:35:24,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 382. [2019-11-27 22:35:24,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-27 22:35:24,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 468 transitions. [2019-11-27 22:35:24,311 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 468 transitions. Word has length 47 [2019-11-27 22:35:24,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:24,311 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 468 transitions. [2019-11-27 22:35:24,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 22:35:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 468 transitions. [2019-11-27 22:35:24,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-27 22:35:24,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:24,316 INFO L410 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] [2019-11-27 22:35:24,317 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:24,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:24,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1259536918, now seen corresponding path program 1 times [2019-11-27 22:35:24,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:24,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588401635] [2019-11-27 22:35:24,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:24,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:24,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588401635] [2019-11-27 22:35:24,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:24,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:24,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74801601] [2019-11-27 22:35:24,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:24,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:24,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:24,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:24,359 INFO L87 Difference]: Start difference. First operand 382 states and 468 transitions. Second operand 3 states. [2019-11-27 22:35:24,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:24,464 INFO L93 Difference]: Finished difference Result 515 states and 638 transitions. [2019-11-27 22:35:24,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:24,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-27 22:35:24,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:24,466 INFO L225 Difference]: With dead ends: 515 [2019-11-27 22:35:24,466 INFO L226 Difference]: Without dead ends: 344 [2019-11-27 22:35:24,467 INFO L630 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-27 22:35:24,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-11-27 22:35:24,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-11-27 22:35:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-11-27 22:35:24,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 419 transitions. [2019-11-27 22:35:24,508 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 419 transitions. Word has length 48 [2019-11-27 22:35:24,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:24,509 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 419 transitions. [2019-11-27 22:35:24,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:24,509 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 419 transitions. [2019-11-27 22:35:24,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-27 22:35:24,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:24,510 INFO L410 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-27 22:35:24,511 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:24,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:24,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1390297930, now seen corresponding path program 1 times [2019-11-27 22:35:24,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:24,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319097149] [2019-11-27 22:35:24,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:24,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-27 22:35:24,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319097149] [2019-11-27 22:35:24,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:24,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-27 22:35:24,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472985913] [2019-11-27 22:35:24,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 22:35:24,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:24,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 22:35:24,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:35:24,577 INFO L87 Difference]: Start difference. First operand 344 states and 419 transitions. Second operand 8 states. [2019-11-27 22:35:24,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:24,708 INFO L93 Difference]: Finished difference Result 356 states and 430 transitions. [2019-11-27 22:35:24,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 22:35:24,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-11-27 22:35:24,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:24,710 INFO L225 Difference]: With dead ends: 356 [2019-11-27 22:35:24,711 INFO L226 Difference]: Without dead ends: 298 [2019-11-27 22:35:24,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-27 22:35:24,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-27 22:35:24,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2019-11-27 22:35:24,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-27 22:35:24,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 361 transitions. [2019-11-27 22:35:24,738 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 361 transitions. Word has length 51 [2019-11-27 22:35:24,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:24,738 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 361 transitions. [2019-11-27 22:35:24,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 22:35:24,738 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 361 transitions. [2019-11-27 22:35:24,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-27 22:35:24,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:24,740 INFO L410 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-27 22:35:24,740 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:24,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:24,740 INFO L82 PathProgramCache]: Analyzing trace with hash -624384568, now seen corresponding path program 1 times [2019-11-27 22:35:24,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:24,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183919351] [2019-11-27 22:35:24,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:24,800 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-27 22:35:24,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183919351] [2019-11-27 22:35:24,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:24,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-27 22:35:24,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721468828] [2019-11-27 22:35:24,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 22:35:24,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:24,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 22:35:24,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-27 22:35:24,802 INFO L87 Difference]: Start difference. First operand 298 states and 361 transitions. Second operand 7 states. [2019-11-27 22:35:25,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:25,086 INFO L93 Difference]: Finished difference Result 422 states and 506 transitions. [2019-11-27 22:35:25,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 22:35:25,086 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-27 22:35:25,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:25,088 INFO L225 Difference]: With dead ends: 422 [2019-11-27 22:35:25,088 INFO L226 Difference]: Without dead ends: 404 [2019-11-27 22:35:25,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 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-27 22:35:25,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-11-27 22:35:25,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 298. [2019-11-27 22:35:25,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-27 22:35:25,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 360 transitions. [2019-11-27 22:35:25,146 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 360 transitions. Word has length 54 [2019-11-27 22:35:25,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:25,147 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 360 transitions. [2019-11-27 22:35:25,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 22:35:25,147 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 360 transitions. [2019-11-27 22:35:25,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-27 22:35:25,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:25,149 INFO L410 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-27 22:35:25,150 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:25,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:25,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1057733436, now seen corresponding path program 1 times [2019-11-27 22:35:25,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:25,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908410492] [2019-11-27 22:35:25,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:25,185 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-27 22:35:25,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908410492] [2019-11-27 22:35:25,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:25,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:25,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916217853] [2019-11-27 22:35:25,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:25,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:25,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:25,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:25,188 INFO L87 Difference]: Start difference. First operand 298 states and 360 transitions. Second operand 3 states. [2019-11-27 22:35:25,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:25,273 INFO L93 Difference]: Finished difference Result 535 states and 654 transitions. [2019-11-27 22:35:25,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:25,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-27 22:35:25,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:25,275 INFO L225 Difference]: With dead ends: 535 [2019-11-27 22:35:25,276 INFO L226 Difference]: Without dead ends: 352 [2019-11-27 22:35:25,276 INFO L630 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-27 22:35:25,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-11-27 22:35:25,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 298. [2019-11-27 22:35:25,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-27 22:35:25,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 357 transitions. [2019-11-27 22:35:25,337 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 357 transitions. Word has length 55 [2019-11-27 22:35:25,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:25,337 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 357 transitions. [2019-11-27 22:35:25,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:25,337 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 357 transitions. [2019-11-27 22:35:25,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-27 22:35:25,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:25,338 INFO L410 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, 1] [2019-11-27 22:35:25,339 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:25,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:25,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1187342961, now seen corresponding path program 1 times [2019-11-27 22:35:25,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:25,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851799158] [2019-11-27 22:35:25,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:25,412 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-27 22:35:25,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851799158] [2019-11-27 22:35:25,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:25,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 22:35:25,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008033113] [2019-11-27 22:35:25,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:35:25,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:25,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:35:25,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:35:25,415 INFO L87 Difference]: Start difference. First operand 298 states and 357 transitions. Second operand 5 states. [2019-11-27 22:35:25,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:25,622 INFO L93 Difference]: Finished difference Result 306 states and 363 transitions. [2019-11-27 22:35:25,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:35:25,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-11-27 22:35:25,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:25,624 INFO L225 Difference]: With dead ends: 306 [2019-11-27 22:35:25,624 INFO L226 Difference]: Without dead ends: 302 [2019-11-27 22:35:25,625 INFO L630 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-27 22:35:25,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-27 22:35:25,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-11-27 22:35:25,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-27 22:35:25,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 356 transitions. [2019-11-27 22:35:25,668 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 356 transitions. Word has length 56 [2019-11-27 22:35:25,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:25,668 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 356 transitions. [2019-11-27 22:35:25,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:35:25,669 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 356 transitions. [2019-11-27 22:35:25,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-27 22:35:25,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:25,670 INFO L410 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, 1, 1] [2019-11-27 22:35:25,670 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:25,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:25,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1863906656, now seen corresponding path program 1 times [2019-11-27 22:35:25,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:25,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509743716] [2019-11-27 22:35:25,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:25,711 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-27 22:35:25,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509743716] [2019-11-27 22:35:25,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:25,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:35:25,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601391739] [2019-11-27 22:35:25,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:35:25,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:25,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:35:25,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:35:25,714 INFO L87 Difference]: Start difference. First operand 298 states and 356 transitions. Second operand 4 states. [2019-11-27 22:35:25,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:25,850 INFO L93 Difference]: Finished difference Result 302 states and 359 transitions. [2019-11-27 22:35:25,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:35:25,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-27 22:35:25,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:25,853 INFO L225 Difference]: With dead ends: 302 [2019-11-27 22:35:25,853 INFO L226 Difference]: Without dead ends: 284 [2019-11-27 22:35:25,854 INFO L630 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-27 22:35:25,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-11-27 22:35:25,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2019-11-27 22:35:25,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-11-27 22:35:25,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 340 transitions. [2019-11-27 22:35:25,910 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 340 transitions. Word has length 57 [2019-11-27 22:35:25,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:25,910 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 340 transitions. [2019-11-27 22:35:25,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:35:25,911 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 340 transitions. [2019-11-27 22:35:25,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-27 22:35:25,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:25,912 INFO L410 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, 1, 1, 1] [2019-11-27 22:35:25,912 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:25,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:25,913 INFO L82 PathProgramCache]: Analyzing trace with hash -576201386, now seen corresponding path program 1 times [2019-11-27 22:35:25,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:25,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036669398] [2019-11-27 22:35:25,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:35:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:35:26,028 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 22:35:26,028 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 22:35:26,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:35:26 BoogieIcfgContainer [2019-11-27 22:35:26,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:35:26,172 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:35:26,173 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:35:26,173 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:35:26,173 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:05" (3/4) ... [2019-11-27 22:35:26,176 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 22:35:26,307 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:35:26,307 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:35:26,309 INFO L168 Benchmark]: Toolchain (without parser) took 23696.63 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 778.6 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -117.6 MB). Peak memory consumption was 660.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:26,310 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:35:26,310 INFO L168 Benchmark]: CACSL2BoogieTranslator took 689.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -158.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:26,311 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:26,312 INFO L168 Benchmark]: Boogie Preprocessor took 119.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:26,312 INFO L168 Benchmark]: RCFGBuilder took 1781.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 902.7 MB in the end (delta: 190.8 MB). Peak memory consumption was 190.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:26,313 INFO L168 Benchmark]: TraceAbstraction took 20848.74 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 633.9 MB). Free memory was 902.7 MB in the beginning and 1.1 GB in the end (delta: -188.7 MB). Peak memory consumption was 445.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:26,313 INFO L168 Benchmark]: Witness Printer took 135.14 ms. Allocated memory is still 1.8 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:26,315 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 689.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -158.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 114.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 119.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1781.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 902.7 MB in the end (delta: 190.8 MB). Peak memory consumption was 190.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20848.74 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 633.9 MB). Free memory was 902.7 MB in the beginning and 1.1 GB in the end (delta: -188.7 MB). Peak memory consumption was 445.1 MB. Max. memory is 11.5 GB. * Witness Printer took 135.14 ms. Allocated memory is still 1.8 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1625]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L40] int FloppyThread ; [L41] int KernelMode ; [L42] int Suspended ; [L43] int Executive ; [L44] int DiskController ; [L45] int FloppyDiskPeripheral ; [L46] int FlConfigCallBack ; [L47] int MaximumInterfaceType ; [L48] int MOUNTDEV_MOUNTED_DEVICE_GUID ; [L49] int myStatus ; [L50] int s ; [L51] int UNLOADED ; [L52] int NP ; [L53] int DC ; [L54] int SKIP1 ; [L55] int SKIP2 ; [L56] int MPR1 ; [L57] int MPR3 ; [L58] int IPC ; [L59] int pended ; [L60] int compRegistered ; [L61] int lowerDriverReturn ; [L62] int setEventCalled ; [L63] int customIrp ; [L86] int PagingReferenceCount = 0; [L87] 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] [L666] int status ; [L667] int irp = __VERIFIER_nondet_int() ; [L668] int pirp ; [L669] int pirp__IoStatus__Status ; [L670] int irp_choice = __VERIFIER_nondet_int() ; [L671] int devobj = __VERIFIER_nondet_int() ; [L672] int __cil_tmp8 ; [L674] FloppyThread = 0 [L675] KernelMode = 0 [L676] Suspended = 0 [L677] Executive = 0 [L678] DiskController = 0 [L679] FloppyDiskPeripheral = 0 [L680] FlConfigCallBack = 0 [L681] MaximumInterfaceType = 0 [L682] MOUNTDEV_MOUNTED_DEVICE_GUID = 0 [L683] myStatus = 0 [L684] s = 0 [L685] UNLOADED = 0 [L686] NP = 0 [L687] DC = 0 [L688] SKIP1 = 0 [L689] SKIP2 = 0 [L690] MPR1 = 0 [L691] MPR3 = 0 [L692] IPC = 0 [L693] pended = 0 [L694] compRegistered = 0 [L695] lowerDriverReturn = 0 [L696] setEventCalled = 0 [L697] customIrp = 0 [L701] status = 0 [L702] pirp = irp [L69] UNLOADED = 0 [L70] NP = 1 [L71] DC = 2 [L72] SKIP1 = 3 [L73] SKIP2 = 4 [L74] MPR1 = 5 [L75] MPR3 = 6 [L76] IPC = 7 [L77] s = UNLOADED [L78] pended = 0 [L79] compRegistered = 0 [L80] lowerDriverReturn = 0 [L81] setEventCalled = 0 [L82] 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] [L705] COND TRUE status >= 0 [L706] s = NP [L707] customIrp = 0 [L708] setEventCalled = customIrp [L709] lowerDriverReturn = setEventCalled [L710] compRegistered = lowerDriverReturn [L711] pended = compRegistered [L712] pirp__IoStatus__Status = 0 [L713] 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] [L714] COND TRUE irp_choice == 0 [L715] pirp__IoStatus__Status = -1073741637 [L716] 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] [L656] s = NP [L657] pended = 0 [L658] compRegistered = 0 [L659] lowerDriverReturn = 0 [L660] setEventCalled = 0 [L661] 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] [L722] COND FALSE !(status < 0) [L726] int tmp_ndt_1; [L727] tmp_ndt_1 = __VERIFIER_nondet_int() [L728] COND FALSE !(tmp_ndt_1 == 0) [L731] int tmp_ndt_2; [L732] tmp_ndt_2 = __VERIFIER_nondet_int() [L733] COND FALSE !(tmp_ndt_2 == 1) [L736] int tmp_ndt_3; [L737] tmp_ndt_3 = __VERIFIER_nondet_int() [L738] COND FALSE !(tmp_ndt_3 == 2) [L741] int tmp_ndt_4; [L742] tmp_ndt_4 = __VERIFIER_nondet_int() [L743] COND TRUE tmp_ndt_4 == 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] [L159] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L160] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L161] int Irp__IoStatus__Information ; [L162] int Irp__IoStatus__Status ; [L163] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L164] int disketteExtension__IsRemoved = __VERIFIER_nondet_int() ; [L165] int disketteExtension__IsStarted = __VERIFIER_nondet_int() ; [L166] int disketteExtension__TargetObject = __VERIFIER_nondet_int() ; [L167] int disketteExtension__HoldNewRequests ; [L168] int disketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L169] int disketteExtension__InterfaceString__Buffer = __VERIFIER_nondet_int() ; [L170] int disketteExtension__InterfaceString = __VERIFIER_nondet_int() ; [L171] int disketteExtension__ArcName__Length = __VERIFIER_nondet_int() ; [L172] int disketteExtension__ArcName = __VERIFIER_nondet_int() ; [L173] int irpSp__MinorFunction = __VERIFIER_nondet_int() ; [L174] int IoGetConfigurationInformation__FloppyCount = __VERIFIER_nondet_int() ; [L175] int irpSp ; [L176] int disketteExtension ; [L177] int ntStatus ; [L178] int doneEvent = __VERIFIER_nondet_int() ; [L179] int irpSp___0 ; [L180] int nextIrpSp ; [L181] int nextIrpSp__Control ; [L182] int irpSp___1 ; [L183] int irpSp__Context ; [L184] int irpSp__Control ; [L185] long __cil_tmp29 ; [L186] long __cil_tmp30 ; [L189] ntStatus = 0 [L190] 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] [L191] 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] [L194] disketteExtension = DeviceObject__DeviceExtension [L195] 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] [L196] 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] [L205] 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] [L208] 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] [L234] 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 FALSE !(! disketteExtension__IsStarted) [L253] disketteExtension__HoldNewRequests = 1 [L96] int status ; [L97] int threadHandle = __VERIFIER_nondet_int() ; [L98] int DisketteExtension__PoweringDown = __VERIFIER_nondet_int() ; [L99] int DisketteExtension__ThreadReferenceCount = __VERIFIER_nondet_int() ; [L100] int DisketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L101] int Irp__IoStatus__Status ; [L102] int Irp__IoStatus__Information ; [L103] int Irp__Tail__Overlay__CurrentStackLocation__Control ; [L104] int ObjAttributes = __VERIFIER_nondet_int() ; [L105] int __cil_tmp12 ; [L106] 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] [L109] COND FALSE !(DisketteExtension__PoweringDown == 1) [L115] 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] [L116] 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] [L148] COND TRUE pended == 0 [L149] 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] [L155] 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] [L254] ntStatus = FlQueueIrpToThread(Irp, disketteExtension) [L257] __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] [L258] COND TRUE __cil_tmp29 == 259L [L1064] 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] [L1073] 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] [L1077] 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] [L1084] int tmp_ndt_12; [L1085] tmp_ndt_12 = __VERIFIER_nondet_int() [L1086] 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=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1092] 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] [L263] 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] [L266] disketteExtension__FloppyThread = 0 [L267] Irp__IoStatus__Status = 0 [L268] 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] [L269] COND TRUE s == NP [L270] 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] [L277] Irp__CurrentLocation ++ [L278] Irp__Tail__Overlay__CurrentStackLocation ++ [L966] int returnVal2 ; [L967] int compRetStatus1 ; [L968] int lcontext = __VERIFIER_nondet_int() ; [L969] 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] [L972] 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] [L985] int tmp_ndt_10; [L986] tmp_ndt_10 = __VERIFIER_nondet_int() [L987] COND TRUE tmp_ndt_10 == 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] [L998] 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] [L1011] 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] [L1015] 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] [L1024] COND TRUE s == SKIP1 [L1025] s = SKIP2 [L1026] 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] [L1034] 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] [L279] ntStatus = IofCallDriver(disketteExtension__TargetObject, Irp) [L425] 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] [L426] 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] [L429] 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] [L765] status = FloppyPnp(devobj, pirp) [L778] 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] [L779] 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] [L786] 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] [L787] 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] [L794] 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] [L795] 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] [L796] 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] [L810] 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] [L811] 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] [L1625] __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, 572 locations, 54 error locations. Result: UNSAFE, OverallTime: 20.6s, OverallIterations: 58, TraceHistogramMax: 1, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 30824 SDtfs, 20140 SDslu, 66794 SDs, 0 SdLazy, 10004 SolverSat, 695 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 407 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=776occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 57 MinimizatonAttempts, 3830 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2017 NumberOfCodeBlocks, 2017 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 1902 ConstructedInterpolants, 0 QuantifiedInterpolants, 180576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 57 InterpolantComputations, 57 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...