./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bcf0b99c-209d-4ebb-9352-40d4a7a37154/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bcf0b99c-209d-4ebb-9352-40d4a7a37154/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bcf0b99c-209d-4ebb-9352-40d4a7a37154/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bcf0b99c-209d-4ebb-9352-40d4a7a37154/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_bcf0b99c-209d-4ebb-9352-40d4a7a37154/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bcf0b99c-209d-4ebb-9352-40d4a7a37154/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-cad4683 [2019-11-15 23:47:53,368 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:47:53,370 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:47:53,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:47:53,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:47:53,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:47:53,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:47:53,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:47:53,398 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:47:53,402 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:47:53,402 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:47:53,403 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:47:53,403 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:47:53,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:47:53,407 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:47:53,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:47:53,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:47:53,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:47:53,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:47:53,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:47:53,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:47:53,421 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:47:53,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:47:53,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:47:53,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:47:53,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:47:53,431 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:47:53,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:47:53,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:47:53,435 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:47:53,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:47:53,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:47:53,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:47:53,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:47:53,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:47:53,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:47:53,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:47:53,441 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:47:53,442 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:47:53,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:47:53,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:47:53,449 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bcf0b99c-209d-4ebb-9352-40d4a7a37154/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:47:53,473 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:47:53,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:47:53,474 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:47:53,474 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:47:53,474 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:47:53,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:47:53,475 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:47:53,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:47:53,475 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:47:53,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:47:53,476 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:47:53,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:47:53,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:47:53,477 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:47:53,477 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:47:53,477 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:47:53,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:47:53,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:47:53,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:47:53,478 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:47:53,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:47:53,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:47:53,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:47:53,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:47:53,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:47:53,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:47:53,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:47:53,481 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:47:53,481 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_bcf0b99c-209d-4ebb-9352-40d4a7a37154/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 579bc16896f0e20e11afe49ee7ceb82dfd52b156 [2019-11-15 23:47:53,506 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:47:53,516 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:47:53,520 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:47:53,522 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:47:53,522 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:47:53,524 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bcf0b99c-209d-4ebb-9352-40d4a7a37154/bin/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c [2019-11-15 23:47:53,575 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bcf0b99c-209d-4ebb-9352-40d4a7a37154/bin/uautomizer/data/5d55d5a82/637216eceac54ffd93cb1ca6dcda4495/FLAGc1c1e02c1 [2019-11-15 23:47:54,023 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:47:54,024 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bcf0b99c-209d-4ebb-9352-40d4a7a37154/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c [2019-11-15 23:47:54,044 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bcf0b99c-209d-4ebb-9352-40d4a7a37154/bin/uautomizer/data/5d55d5a82/637216eceac54ffd93cb1ca6dcda4495/FLAGc1c1e02c1 [2019-11-15 23:47:54,545 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bcf0b99c-209d-4ebb-9352-40d4a7a37154/bin/uautomizer/data/5d55d5a82/637216eceac54ffd93cb1ca6dcda4495 [2019-11-15 23:47:54,547 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:47:54,549 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:47:54,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:47:54,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:47:54,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:47:54,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:47:54" (1/1) ... [2019-11-15 23:47:54,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c50c72c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:54, skipping insertion in model container [2019-11-15 23:47:54,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:47:54" (1/1) ... [2019-11-15 23:47:54,563 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:47:54,629 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:47:55,031 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:47:55,035 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:47:55,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:47:55,165 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:47:55,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:55 WrapperNode [2019-11-15 23:47:55,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:47:55,166 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:47:55,166 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:47:55,166 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:47:55,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:55" (1/1) ... [2019-11-15 23:47:55,196 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:55" (1/1) ... [2019-11-15 23:47:55,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:47:55,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:47:55,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:47:55,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:47:55,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:55" (1/1) ... [2019-11-15 23:47:55,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:55" (1/1) ... [2019-11-15 23:47:55,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:55" (1/1) ... [2019-11-15 23:47:55,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:55" (1/1) ... [2019-11-15 23:47:55,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:55" (1/1) ... [2019-11-15 23:47:55,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:55" (1/1) ... [2019-11-15 23:47:55,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:55" (1/1) ... [2019-11-15 23:47:55,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:47:55,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:47:55,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:47:55,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:47:55,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bcf0b99c-209d-4ebb-9352-40d4a7a37154/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:47:55,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:47:55,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:47:55,825 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,846 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,854 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,861 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,863 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,864 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,868 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,877 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,881 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,886 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,887 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,888 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,891 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,893 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,894 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,895 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,897 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,899 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,900 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,901 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,903 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,905 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,908 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,910 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,912 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,915 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,917 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,919 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,919 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:55,922 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:47:57,333 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##658: assume !false; [2019-11-15 23:47:57,333 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##657: assume false; [2019-11-15 23:47:57,333 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##665: assume !false; [2019-11-15 23:47:57,333 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##664: assume false; [2019-11-15 23:47:57,334 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##683: assume false; [2019-11-15 23:47:57,334 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume !false; [2019-11-15 23:47:57,334 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2019-11-15 23:47:57,334 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2019-11-15 23:47:57,335 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume false; [2019-11-15 23:47:57,335 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##640: assume !false; [2019-11-15 23:47:57,335 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2019-11-15 23:47:57,335 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2019-11-15 23:47:57,335 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2019-11-15 23:47:57,336 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2019-11-15 23:47:57,336 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume !false; [2019-11-15 23:47:57,336 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##284: assume false; [2019-11-15 23:47:57,336 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##229: assume !false; [2019-11-15 23:47:57,336 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##228: assume false; [2019-11-15 23:47:57,336 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2019-11-15 23:47:57,337 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2019-11-15 23:47:57,337 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##369: assume !false; [2019-11-15 23:47:57,337 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##375: assume !false; [2019-11-15 23:47:57,337 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##374: assume false; [2019-11-15 23:47:57,337 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2019-11-15 23:47:57,338 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2019-11-15 23:47:57,338 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##357: assume false; [2019-11-15 23:47:57,338 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##358: assume !false; [2019-11-15 23:47:57,338 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##368: assume false; [2019-11-15 23:47:57,338 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##404: assume !false; [2019-11-15 23:47:57,339 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##403: assume false; [2019-11-15 23:47:57,339 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume !false; [2019-11-15 23:47:57,339 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##426: assume false; [2019-11-15 23:47:57,339 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##436: assume !false; [2019-11-15 23:47:57,339 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##435: assume false; [2019-11-15 23:47:57,339 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##439: assume false; [2019-11-15 23:47:57,340 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##440: assume !false; [2019-11-15 23:47:57,340 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2019-11-15 23:47:57,340 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2019-11-15 23:47:57,340 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##485: assume !false; [2019-11-15 23:47:57,340 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##484: assume false; [2019-11-15 23:47:57,341 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##524: assume !false; [2019-11-15 23:47:57,341 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##523: assume false; [2019-11-15 23:47:57,341 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##558: assume !false; [2019-11-15 23:47:57,341 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##557: assume false; [2019-11-15 23:47:57,341 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume !false; [2019-11-15 23:47:57,341 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##186: assume false; [2019-11-15 23:47:57,342 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##68: assume !false; [2019-11-15 23:47:57,342 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume false; [2019-11-15 23:47:57,342 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##144: assume false; [2019-11-15 23:47:57,342 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##145: assume !false; [2019-11-15 23:47:57,342 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2019-11-15 23:47:57,343 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2019-11-15 23:47:57,343 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##154: assume !false; [2019-11-15 23:47:57,343 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume false; [2019-11-15 23:47:57,343 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2019-11-15 23:47:57,343 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2019-11-15 23:47:57,343 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##588: assume !false; [2019-11-15 23:47:57,344 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##587: assume false; [2019-11-15 23:47:57,344 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2019-11-15 23:47:57,344 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2019-11-15 23:47:57,345 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:47:57,345 INFO L284 CfgBuilder]: Removed 277 assume(true) statements. [2019-11-15 23:47:57,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:47:57 BoogieIcfgContainer [2019-11-15 23:47:57,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:47:57,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:47:57,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:47:57,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:47:57,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:47:54" (1/3) ... [2019-11-15 23:47:57,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@acc274a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:47:57, skipping insertion in model container [2019-11-15 23:47:57,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:55" (2/3) ... [2019-11-15 23:47:57,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@acc274a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:47:57, skipping insertion in model container [2019-11-15 23:47:57,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:47:57" (3/3) ... [2019-11-15 23:47:57,358 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-1.c [2019-11-15 23:47:57,367 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:47:57,376 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 54 error locations. [2019-11-15 23:47:57,386 INFO L249 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2019-11-15 23:47:57,425 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:47:57,426 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:47:57,426 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:47:57,426 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:47:57,427 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:47:57,427 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:47:57,428 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:47:57,428 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:47:57,466 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states. [2019-11-15 23:47:57,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 23:47:57,471 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:57,472 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:57,475 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:57,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:57,481 INFO L82 PathProgramCache]: Analyzing trace with hash 538056098, now seen corresponding path program 1 times [2019-11-15 23:47:57,488 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:57,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224876057] [2019-11-15 23:47:57,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:57,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:57,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:57,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-15 23:47:57,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224876057] [2019-11-15 23:47:57,701 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:47:57,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:47:57,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821874431] [2019-11-15 23:47:57,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:47:57,705 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:57,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:47:57,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:47:57,720 INFO L87 Difference]: Start difference. First operand 572 states. Second operand 3 states. [2019-11-15 23:47:58,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:58,244 INFO L93 Difference]: Finished difference Result 1136 states and 1626 transitions. [2019-11-15 23:47:58,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:47:58,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-15 23:47:58,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:58,265 INFO L225 Difference]: With dead ends: 1136 [2019-11-15 23:47:58,265 INFO L226 Difference]: Without dead ends: 692 [2019-11-15 23:47:58,270 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:47:58,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-11-15 23:47:58,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 666. [2019-11-15 23:47:58,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-11-15 23:47:58,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 905 transitions. [2019-11-15 23:47:58,366 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 905 transitions. Word has length 10 [2019-11-15 23:47:58,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:58,366 INFO L462 AbstractCegarLoop]: Abstraction has 666 states and 905 transitions. [2019-11-15 23:47:58,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:47:58,367 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 905 transitions. [2019-11-15 23:47:58,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 23:47:58,367 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:58,368 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:58,369 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:58,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:58,369 INFO L82 PathProgramCache]: Analyzing trace with hash 369677969, now seen corresponding path program 1 times [2019-11-15 23:47:58,369 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:58,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400272000] [2019-11-15 23:47:58,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:58,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:58,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:58,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:58,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400272000] [2019-11-15 23:47:58,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:47:58,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:47:58,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051669759] [2019-11-15 23:47:58,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:47:58,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:58,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:47:58,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:47:58,465 INFO L87 Difference]: Start difference. First operand 666 states and 905 transitions. Second operand 3 states. [2019-11-15 23:47:58,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:58,510 INFO L93 Difference]: Finished difference Result 688 states and 930 transitions. [2019-11-15 23:47:58,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:47:58,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-15 23:47:58,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:58,515 INFO L225 Difference]: With dead ends: 688 [2019-11-15 23:47:58,515 INFO L226 Difference]: Without dead ends: 666 [2019-11-15 23:47:58,518 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:47:58,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-11-15 23:47:58,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2019-11-15 23:47:58,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-11-15 23:47:58,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 904 transitions. [2019-11-15 23:47:58,559 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 904 transitions. Word has length 11 [2019-11-15 23:47:58,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:58,559 INFO L462 AbstractCegarLoop]: Abstraction has 666 states and 904 transitions. [2019-11-15 23:47:58,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:47:58,560 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 904 transitions. [2019-11-15 23:47:58,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 23:47:58,561 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:58,561 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:58,563 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:58,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:58,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1535696421, now seen corresponding path program 1 times [2019-11-15 23:47:58,563 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:58,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708080279] [2019-11-15 23:47:58,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:58,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:58,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:58,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:58,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708080279] [2019-11-15 23:47:58,703 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:47:58,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:47:58,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571576026] [2019-11-15 23:47:58,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:47:58,704 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:58,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:47:58,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:47:58,705 INFO L87 Difference]: Start difference. First operand 666 states and 904 transitions. Second operand 3 states. [2019-11-15 23:47:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:58,765 INFO L93 Difference]: Finished difference Result 762 states and 1022 transitions. [2019-11-15 23:47:58,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:47:58,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-15 23:47:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:58,770 INFO L225 Difference]: With dead ends: 762 [2019-11-15 23:47:58,770 INFO L226 Difference]: Without dead ends: 735 [2019-11-15 23:47:58,771 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:47:58,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-11-15 23:47:58,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 686. [2019-11-15 23:47:58,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-11-15 23:47:58,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 941 transitions. [2019-11-15 23:47:58,800 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 941 transitions. Word has length 16 [2019-11-15 23:47:58,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:58,800 INFO L462 AbstractCegarLoop]: Abstraction has 686 states and 941 transitions. [2019-11-15 23:47:58,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:47:58,801 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 941 transitions. [2019-11-15 23:47:58,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:47:58,802 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:58,802 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:58,803 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:58,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:58,804 INFO L82 PathProgramCache]: Analyzing trace with hash 107438083, now seen corresponding path program 1 times [2019-11-15 23:47:58,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:58,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701511075] [2019-11-15 23:47:58,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:58,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:58,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:58,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:58,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701511075] [2019-11-15 23:47:58,849 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:47:58,849 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:47:58,849 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854395172] [2019-11-15 23:47:58,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:47:58,849 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:58,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:47:58,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:47:58,850 INFO L87 Difference]: Start difference. First operand 686 states and 941 transitions. Second operand 3 states. [2019-11-15 23:47:59,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:59,097 INFO L93 Difference]: Finished difference Result 723 states and 987 transitions. [2019-11-15 23:47:59,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:47:59,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-15 23:47:59,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:59,103 INFO L225 Difference]: With dead ends: 723 [2019-11-15 23:47:59,103 INFO L226 Difference]: Without dead ends: 718 [2019-11-15 23:47:59,104 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:47:59,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-11-15 23:47:59,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 715. [2019-11-15 23:47:59,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-11-15 23:47:59,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 979 transitions. [2019-11-15 23:47:59,144 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 979 transitions. Word has length 19 [2019-11-15 23:47:59,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:59,145 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 979 transitions. [2019-11-15 23:47:59,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:47:59,145 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 979 transitions. [2019-11-15 23:47:59,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:47:59,150 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:59,150 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:59,156 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:59,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:59,156 INFO L82 PathProgramCache]: Analyzing trace with hash 98463890, now seen corresponding path program 1 times [2019-11-15 23:47:59,156 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:59,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235965127] [2019-11-15 23:47:59,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:59,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:59,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:59,231 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235965127] [2019-11-15 23:47:59,231 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:47:59,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:47:59,232 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513322855] [2019-11-15 23:47:59,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:47:59,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:59,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:47:59,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:47:59,232 INFO L87 Difference]: Start difference. First operand 715 states and 979 transitions. Second operand 3 states. [2019-11-15 23:47:59,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:59,316 INFO L93 Difference]: Finished difference Result 1230 states and 1671 transitions. [2019-11-15 23:47:59,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:47:59,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-15 23:47:59,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:59,322 INFO L225 Difference]: With dead ends: 1230 [2019-11-15 23:47:59,322 INFO L226 Difference]: Without dead ends: 858 [2019-11-15 23:47:59,324 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:47:59,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2019-11-15 23:47:59,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 697. [2019-11-15 23:47:59,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-11-15 23:47:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 955 transitions. [2019-11-15 23:47:59,363 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 955 transitions. Word has length 19 [2019-11-15 23:47:59,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:59,363 INFO L462 AbstractCegarLoop]: Abstraction has 697 states and 955 transitions. [2019-11-15 23:47:59,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:47:59,364 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 955 transitions. [2019-11-15 23:47:59,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 23:47:59,366 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:59,366 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:59,366 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:59,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:59,367 INFO L82 PathProgramCache]: Analyzing trace with hash -946806949, now seen corresponding path program 1 times [2019-11-15 23:47:59,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:59,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729266338] [2019-11-15 23:47:59,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:59,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:59,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:59,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:59,430 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729266338] [2019-11-15 23:47:59,430 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:47:59,430 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:47:59,430 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217035970] [2019-11-15 23:47:59,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:47:59,431 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:59,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:47:59,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:47:59,431 INFO L87 Difference]: Start difference. First operand 697 states and 955 transitions. Second operand 4 states. [2019-11-15 23:47:59,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:59,494 INFO L93 Difference]: Finished difference Result 709 states and 968 transitions. [2019-11-15 23:47:59,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:47:59,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-15 23:47:59,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:59,499 INFO L225 Difference]: With dead ends: 709 [2019-11-15 23:47:59,499 INFO L226 Difference]: Without dead ends: 689 [2019-11-15 23:47:59,499 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:47:59,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-11-15 23:47:59,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2019-11-15 23:47:59,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-11-15 23:47:59,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 945 transitions. [2019-11-15 23:47:59,532 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 945 transitions. Word has length 20 [2019-11-15 23:47:59,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:59,532 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 945 transitions. [2019-11-15 23:47:59,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:47:59,533 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 945 transitions. [2019-11-15 23:47:59,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 23:47:59,533 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:59,534 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:59,534 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:59,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:59,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2136813194, now seen corresponding path program 1 times [2019-11-15 23:47:59,535 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:59,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802989671] [2019-11-15 23:47:59,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:59,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:59,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:59,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802989671] [2019-11-15 23:47:59,566 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:47:59,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:47:59,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246513423] [2019-11-15 23:47:59,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:47:59,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:59,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:47:59,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:47:59,568 INFO L87 Difference]: Start difference. First operand 689 states and 945 transitions. Second operand 3 states. [2019-11-15 23:47:59,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:59,868 INFO L93 Difference]: Finished difference Result 689 states and 945 transitions. [2019-11-15 23:47:59,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:47:59,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 23:47:59,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:59,873 INFO L225 Difference]: With dead ends: 689 [2019-11-15 23:47:59,873 INFO L226 Difference]: Without dead ends: 673 [2019-11-15 23:47:59,873 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:47:59,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-11-15 23:47:59,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2019-11-15 23:47:59,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-11-15 23:47:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 928 transitions. [2019-11-15 23:47:59,905 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 928 transitions. Word has length 23 [2019-11-15 23:47:59,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:59,905 INFO L462 AbstractCegarLoop]: Abstraction has 673 states and 928 transitions. [2019-11-15 23:47:59,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:47:59,906 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 928 transitions. [2019-11-15 23:47:59,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:47:59,907 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:59,907 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:59,907 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:59,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:59,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1059387616, now seen corresponding path program 1 times [2019-11-15 23:47:59,908 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:59,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480279207] [2019-11-15 23:47:59,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:59,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:59,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:59,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:59,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480279207] [2019-11-15 23:47:59,945 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:47:59,945 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:47:59,945 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486041397] [2019-11-15 23:47:59,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:47:59,946 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:59,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:47:59,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:47:59,946 INFO L87 Difference]: Start difference. First operand 673 states and 928 transitions. Second operand 4 states. [2019-11-15 23:48:00,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:00,010 INFO L93 Difference]: Finished difference Result 686 states and 942 transitions. [2019-11-15 23:48:00,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:48:00,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-15 23:48:00,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:00,015 INFO L225 Difference]: With dead ends: 686 [2019-11-15 23:48:00,015 INFO L226 Difference]: Without dead ends: 671 [2019-11-15 23:48:00,016 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:48:00,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-11-15 23:48:00,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2019-11-15 23:48:00,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2019-11-15 23:48:00,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 925 transitions. [2019-11-15 23:48:00,046 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 925 transitions. Word has length 24 [2019-11-15 23:48:00,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:00,047 INFO L462 AbstractCegarLoop]: Abstraction has 671 states and 925 transitions. [2019-11-15 23:48:00,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:48:00,048 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 925 transitions. [2019-11-15 23:48:00,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 23:48:00,049 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:00,049 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:00,049 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:00,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:00,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1371761021, now seen corresponding path program 1 times [2019-11-15 23:48:00,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:00,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870373055] [2019-11-15 23:48:00,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:00,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:00,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:00,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:00,081 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870373055] [2019-11-15 23:48:00,081 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:00,081 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:48:00,081 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869010583] [2019-11-15 23:48:00,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:48:00,082 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:00,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:48:00,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:48:00,082 INFO L87 Difference]: Start difference. First operand 671 states and 925 transitions. Second operand 3 states. [2019-11-15 23:48:00,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:00,320 INFO L93 Difference]: Finished difference Result 873 states and 1195 transitions. [2019-11-15 23:48:00,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:48:00,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 23:48:00,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:00,326 INFO L225 Difference]: With dead ends: 873 [2019-11-15 23:48:00,326 INFO L226 Difference]: Without dead ends: 865 [2019-11-15 23:48:00,326 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:48:00,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-11-15 23:48:00,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 689. [2019-11-15 23:48:00,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-11-15 23:48:00,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 952 transitions. [2019-11-15 23:48:00,362 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 952 transitions. Word has length 25 [2019-11-15 23:48:00,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:00,363 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 952 transitions. [2019-11-15 23:48:00,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:48:00,364 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 952 transitions. [2019-11-15 23:48:00,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:48:00,366 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:00,366 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:00,366 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:00,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:00,367 INFO L82 PathProgramCache]: Analyzing trace with hash 417423376, now seen corresponding path program 1 times [2019-11-15 23:48:00,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:00,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019363794] [2019-11-15 23:48:00,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:00,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:00,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:00,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:00,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019363794] [2019-11-15 23:48:00,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:00,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:48:00,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859427467] [2019-11-15 23:48:00,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:48:00,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:00,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:48:00,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:48:00,462 INFO L87 Difference]: Start difference. First operand 689 states and 952 transitions. Second operand 7 states. [2019-11-15 23:48:01,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:01,214 INFO L93 Difference]: Finished difference Result 1033 states and 1388 transitions. [2019-11-15 23:48:01,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:48:01,215 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-15 23:48:01,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:01,219 INFO L225 Difference]: With dead ends: 1033 [2019-11-15 23:48:01,220 INFO L226 Difference]: Without dead ends: 774 [2019-11-15 23:48:01,226 INFO L600 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-15 23:48:01,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-11-15 23:48:01,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 672. [2019-11-15 23:48:01,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2019-11-15 23:48:01,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 916 transitions. [2019-11-15 23:48:01,261 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 916 transitions. Word has length 26 [2019-11-15 23:48:01,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:01,262 INFO L462 AbstractCegarLoop]: Abstraction has 672 states and 916 transitions. [2019-11-15 23:48:01,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:48:01,262 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 916 transitions. [2019-11-15 23:48:01,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:48:01,264 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:01,264 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:01,265 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:01,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:01,265 INFO L82 PathProgramCache]: Analyzing trace with hash -65568844, now seen corresponding path program 1 times [2019-11-15 23:48:01,265 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:01,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417042577] [2019-11-15 23:48:01,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:01,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:01,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:01,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:01,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417042577] [2019-11-15 23:48:01,301 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:01,301 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:48:01,301 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554090373] [2019-11-15 23:48:01,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:48:01,302 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:01,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:48:01,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:48:01,302 INFO L87 Difference]: Start difference. First operand 672 states and 916 transitions. Second operand 4 states. [2019-11-15 23:48:01,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:01,361 INFO L93 Difference]: Finished difference Result 685 states and 930 transitions. [2019-11-15 23:48:01,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:48:01,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-15 23:48:01,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:01,366 INFO L225 Difference]: With dead ends: 685 [2019-11-15 23:48:01,366 INFO L226 Difference]: Without dead ends: 670 [2019-11-15 23:48:01,367 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:48:01,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-11-15 23:48:01,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2019-11-15 23:48:01,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-11-15 23:48:01,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 913 transitions. [2019-11-15 23:48:01,400 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 913 transitions. Word has length 26 [2019-11-15 23:48:01,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:01,402 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 913 transitions. [2019-11-15 23:48:01,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:48:01,402 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 913 transitions. [2019-11-15 23:48:01,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:48:01,404 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:01,404 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:01,404 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:01,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:01,405 INFO L82 PathProgramCache]: Analyzing trace with hash 2044140679, now seen corresponding path program 1 times [2019-11-15 23:48:01,405 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:01,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308401344] [2019-11-15 23:48:01,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:01,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:01,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:01,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:01,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308401344] [2019-11-15 23:48:01,448 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:01,448 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:48:01,448 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900184710] [2019-11-15 23:48:01,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:48:01,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:01,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:48:01,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:48:01,449 INFO L87 Difference]: Start difference. First operand 670 states and 913 transitions. Second operand 4 states. [2019-11-15 23:48:01,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:01,527 INFO L93 Difference]: Finished difference Result 708 states and 954 transitions. [2019-11-15 23:48:01,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:48:01,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-15 23:48:01,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:01,531 INFO L225 Difference]: With dead ends: 708 [2019-11-15 23:48:01,532 INFO L226 Difference]: Without dead ends: 687 [2019-11-15 23:48:01,532 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:48:01,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-11-15 23:48:01,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 672. [2019-11-15 23:48:01,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2019-11-15 23:48:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 915 transitions. [2019-11-15 23:48:01,609 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 915 transitions. Word has length 27 [2019-11-15 23:48:01,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:01,609 INFO L462 AbstractCegarLoop]: Abstraction has 672 states and 915 transitions. [2019-11-15 23:48:01,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:48:01,610 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 915 transitions. [2019-11-15 23:48:01,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:48:01,613 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:01,614 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:01,614 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:01,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:01,615 INFO L82 PathProgramCache]: Analyzing trace with hash -610986493, now seen corresponding path program 1 times [2019-11-15 23:48:01,615 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:01,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161908346] [2019-11-15 23:48:01,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:01,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:01,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:01,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:01,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161908346] [2019-11-15 23:48:01,650 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:01,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:48:01,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740460981] [2019-11-15 23:48:01,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:48:01,651 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:01,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:48:01,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:48:01,652 INFO L87 Difference]: Start difference. First operand 672 states and 915 transitions. Second operand 3 states. [2019-11-15 23:48:01,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:01,698 INFO L93 Difference]: Finished difference Result 703 states and 951 transitions. [2019-11-15 23:48:01,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:48:01,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-15 23:48:01,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:01,703 INFO L225 Difference]: With dead ends: 703 [2019-11-15 23:48:01,703 INFO L226 Difference]: Without dead ends: 661 [2019-11-15 23:48:01,704 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:48:01,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-11-15 23:48:01,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 658. [2019-11-15 23:48:01,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-15 23:48:01,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 891 transitions. [2019-11-15 23:48:01,737 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 891 transitions. Word has length 27 [2019-11-15 23:48:01,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:01,737 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 891 transitions. [2019-11-15 23:48:01,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:48:01,738 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 891 transitions. [2019-11-15 23:48:01,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 23:48:01,739 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:01,739 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:01,739 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:01,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:01,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1636712997, now seen corresponding path program 1 times [2019-11-15 23:48:01,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:01,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33256830] [2019-11-15 23:48:01,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:01,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:01,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:01,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:01,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33256830] [2019-11-15 23:48:01,779 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:01,779 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:48:01,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597272983] [2019-11-15 23:48:01,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:48:01,780 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:01,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:48:01,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:48:01,780 INFO L87 Difference]: Start difference. First operand 658 states and 891 transitions. Second operand 4 states. [2019-11-15 23:48:01,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:01,846 INFO L93 Difference]: Finished difference Result 696 states and 932 transitions. [2019-11-15 23:48:01,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:48:01,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-15 23:48:01,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:01,851 INFO L225 Difference]: With dead ends: 696 [2019-11-15 23:48:01,851 INFO L226 Difference]: Without dead ends: 675 [2019-11-15 23:48:01,853 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:48:01,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-11-15 23:48:01,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 658. [2019-11-15 23:48:01,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-15 23:48:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 891 transitions. [2019-11-15 23:48:01,884 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 891 transitions. Word has length 28 [2019-11-15 23:48:01,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:01,884 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 891 transitions. [2019-11-15 23:48:01,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:48:01,884 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 891 transitions. [2019-11-15 23:48:01,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 23:48:01,885 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:01,886 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:01,886 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:01,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:01,886 INFO L82 PathProgramCache]: Analyzing trace with hash 615538312, now seen corresponding path program 1 times [2019-11-15 23:48:01,887 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:01,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993663047] [2019-11-15 23:48:01,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:01,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:01,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:01,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:01,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993663047] [2019-11-15 23:48:01,962 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:01,962 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:48:01,962 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963099881] [2019-11-15 23:48:01,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:48:01,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:01,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:48:01,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:48:01,963 INFO L87 Difference]: Start difference. First operand 658 states and 891 transitions. Second operand 8 states. [2019-11-15 23:48:02,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:02,628 INFO L93 Difference]: Finished difference Result 680 states and 913 transitions. [2019-11-15 23:48:02,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:48:02,629 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-15 23:48:02,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:02,633 INFO L225 Difference]: With dead ends: 680 [2019-11-15 23:48:02,633 INFO L226 Difference]: Without dead ends: 675 [2019-11-15 23:48:02,635 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:48:02,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-11-15 23:48:02,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 668. [2019-11-15 23:48:02,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-11-15 23:48:02,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 901 transitions. [2019-11-15 23:48:02,670 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 901 transitions. Word has length 29 [2019-11-15 23:48:02,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:02,670 INFO L462 AbstractCegarLoop]: Abstraction has 668 states and 901 transitions. [2019-11-15 23:48:02,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:48:02,670 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 901 transitions. [2019-11-15 23:48:02,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 23:48:02,672 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:02,672 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:02,672 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:02,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:02,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1368856645, now seen corresponding path program 1 times [2019-11-15 23:48:02,673 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:02,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974928671] [2019-11-15 23:48:02,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:02,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:02,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:02,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:02,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974928671] [2019-11-15 23:48:02,766 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:02,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:48:02,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970783995] [2019-11-15 23:48:02,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:48:02,766 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:02,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:48:02,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:48:02,767 INFO L87 Difference]: Start difference. First operand 668 states and 901 transitions. Second operand 8 states. [2019-11-15 23:48:03,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:03,484 INFO L93 Difference]: Finished difference Result 680 states and 912 transitions. [2019-11-15 23:48:03,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:48:03,484 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-11-15 23:48:03,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:03,488 INFO L225 Difference]: With dead ends: 680 [2019-11-15 23:48:03,488 INFO L226 Difference]: Without dead ends: 675 [2019-11-15 23:48:03,489 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:48:03,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-11-15 23:48:03,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 669. [2019-11-15 23:48:03,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2019-11-15 23:48:03,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 902 transitions. [2019-11-15 23:48:03,525 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 902 transitions. Word has length 30 [2019-11-15 23:48:03,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:03,526 INFO L462 AbstractCegarLoop]: Abstraction has 669 states and 902 transitions. [2019-11-15 23:48:03,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:48:03,527 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 902 transitions. [2019-11-15 23:48:03,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 23:48:03,528 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:03,528 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:03,566 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:03,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:03,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1926759716, now seen corresponding path program 1 times [2019-11-15 23:48:03,567 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:03,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355349816] [2019-11-15 23:48:03,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:03,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:03,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:03,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:03,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355349816] [2019-11-15 23:48:03,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:03,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:48:03,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668098695] [2019-11-15 23:48:03,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:48:03,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:03,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:48:03,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:48:03,619 INFO L87 Difference]: Start difference. First operand 669 states and 902 transitions. Second operand 5 states. [2019-11-15 23:48:03,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:03,740 INFO L93 Difference]: Finished difference Result 684 states and 918 transitions. [2019-11-15 23:48:03,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:48:03,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-15 23:48:03,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:03,745 INFO L225 Difference]: With dead ends: 684 [2019-11-15 23:48:03,745 INFO L226 Difference]: Without dead ends: 667 [2019-11-15 23:48:03,746 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:48:03,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2019-11-15 23:48:03,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2019-11-15 23:48:03,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2019-11-15 23:48:03,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 897 transitions. [2019-11-15 23:48:03,783 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 897 transitions. Word has length 30 [2019-11-15 23:48:03,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:03,783 INFO L462 AbstractCegarLoop]: Abstraction has 667 states and 897 transitions. [2019-11-15 23:48:03,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:48:03,783 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 897 transitions. [2019-11-15 23:48:03,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 23:48:03,785 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:03,785 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:03,785 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:03,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:03,786 INFO L82 PathProgramCache]: Analyzing trace with hash 455234987, now seen corresponding path program 1 times [2019-11-15 23:48:03,786 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:03,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248997575] [2019-11-15 23:48:03,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:03,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:03,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:03,882 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248997575] [2019-11-15 23:48:03,882 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:03,882 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:48:03,882 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835047779] [2019-11-15 23:48:03,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:48:03,883 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:03,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:48:03,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:48:03,883 INFO L87 Difference]: Start difference. First operand 667 states and 897 transitions. Second operand 9 states. [2019-11-15 23:48:04,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:04,664 INFO L93 Difference]: Finished difference Result 693 states and 921 transitions. [2019-11-15 23:48:04,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:48:04,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-11-15 23:48:04,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:04,669 INFO L225 Difference]: With dead ends: 693 [2019-11-15 23:48:04,669 INFO L226 Difference]: Without dead ends: 684 [2019-11-15 23:48:04,669 INFO L600 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-15 23:48:04,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2019-11-15 23:48:04,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 667. [2019-11-15 23:48:04,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2019-11-15 23:48:04,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 895 transitions. [2019-11-15 23:48:04,703 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 895 transitions. Word has length 30 [2019-11-15 23:48:04,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:04,703 INFO L462 AbstractCegarLoop]: Abstraction has 667 states and 895 transitions. [2019-11-15 23:48:04,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:48:04,704 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 895 transitions. [2019-11-15 23:48:04,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 23:48:04,704 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:04,705 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:04,705 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:04,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:04,705 INFO L82 PathProgramCache]: Analyzing trace with hash -879074465, now seen corresponding path program 1 times [2019-11-15 23:48:04,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:04,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848036781] [2019-11-15 23:48:04,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:04,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:04,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:04,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:04,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848036781] [2019-11-15 23:48:04,782 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:04,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:48:04,783 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084063420] [2019-11-15 23:48:04,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:48:04,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:04,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:48:04,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:48:04,783 INFO L87 Difference]: Start difference. First operand 667 states and 895 transitions. Second operand 5 states. [2019-11-15 23:48:04,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:04,894 INFO L93 Difference]: Finished difference Result 673 states and 900 transitions. [2019-11-15 23:48:04,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:48:04,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-15 23:48:04,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:04,898 INFO L225 Difference]: With dead ends: 673 [2019-11-15 23:48:04,898 INFO L226 Difference]: Without dead ends: 650 [2019-11-15 23:48:04,899 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:48:04,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-11-15 23:48:04,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-11-15 23:48:04,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-11-15 23:48:04,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 866 transitions. [2019-11-15 23:48:04,933 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 866 transitions. Word has length 31 [2019-11-15 23:48:04,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:04,934 INFO L462 AbstractCegarLoop]: Abstraction has 650 states and 866 transitions. [2019-11-15 23:48:04,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:48:04,934 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 866 transitions. [2019-11-15 23:48:04,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 23:48:04,935 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:04,937 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:04,937 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:04,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:04,937 INFO L82 PathProgramCache]: Analyzing trace with hash 932056973, now seen corresponding path program 1 times [2019-11-15 23:48:04,938 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:04,938 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877113699] [2019-11-15 23:48:04,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:04,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:04,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:04,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:04,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877113699] [2019-11-15 23:48:04,965 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:04,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:48:04,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157989913] [2019-11-15 23:48:04,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:48:04,965 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:04,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:48:04,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:48:04,966 INFO L87 Difference]: Start difference. First operand 650 states and 866 transitions. Second operand 3 states. [2019-11-15 23:48:05,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:05,188 INFO L93 Difference]: Finished difference Result 839 states and 1102 transitions. [2019-11-15 23:48:05,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:48:05,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-15 23:48:05,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:05,193 INFO L225 Difference]: With dead ends: 839 [2019-11-15 23:48:05,193 INFO L226 Difference]: Without dead ends: 826 [2019-11-15 23:48:05,195 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:48:05,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2019-11-15 23:48:05,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 702. [2019-11-15 23:48:05,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-11-15 23:48:05,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 926 transitions. [2019-11-15 23:48:05,231 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 926 transitions. Word has length 31 [2019-11-15 23:48:05,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:05,232 INFO L462 AbstractCegarLoop]: Abstraction has 702 states and 926 transitions. [2019-11-15 23:48:05,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:48:05,232 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 926 transitions. [2019-11-15 23:48:05,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 23:48:05,233 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:05,233 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:05,234 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:05,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:05,234 INFO L82 PathProgramCache]: Analyzing trace with hash 694420866, now seen corresponding path program 1 times [2019-11-15 23:48:05,234 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:05,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895430761] [2019-11-15 23:48:05,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:05,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:05,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:05,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:05,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895430761] [2019-11-15 23:48:05,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:05,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:48:05,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590768037] [2019-11-15 23:48:05,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:48:05,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:05,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:48:05,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:48:05,357 INFO L87 Difference]: Start difference. First operand 702 states and 926 transitions. Second operand 9 states. [2019-11-15 23:48:06,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:06,263 INFO L93 Difference]: Finished difference Result 728 states and 949 transitions. [2019-11-15 23:48:06,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:48:06,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-15 23:48:06,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:06,268 INFO L225 Difference]: With dead ends: 728 [2019-11-15 23:48:06,268 INFO L226 Difference]: Without dead ends: 719 [2019-11-15 23:48:06,268 INFO L600 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-15 23:48:06,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-11-15 23:48:06,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 702. [2019-11-15 23:48:06,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-11-15 23:48:06,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 924 transitions. [2019-11-15 23:48:06,305 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 924 transitions. Word has length 31 [2019-11-15 23:48:06,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:06,305 INFO L462 AbstractCegarLoop]: Abstraction has 702 states and 924 transitions. [2019-11-15 23:48:06,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:48:06,305 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 924 transitions. [2019-11-15 23:48:06,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 23:48:06,306 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:06,306 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:06,307 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:06,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:06,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1700782205, now seen corresponding path program 1 times [2019-11-15 23:48:06,307 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:06,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177336868] [2019-11-15 23:48:06,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:06,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:06,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:06,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:06,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177336868] [2019-11-15 23:48:06,337 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:06,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:48:06,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4322370] [2019-11-15 23:48:06,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:48:06,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:06,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:48:06,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:48:06,338 INFO L87 Difference]: Start difference. First operand 702 states and 924 transitions. Second operand 3 states. [2019-11-15 23:48:06,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:06,527 INFO L93 Difference]: Finished difference Result 910 states and 1200 transitions. [2019-11-15 23:48:06,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:48:06,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-15 23:48:06,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:06,535 INFO L225 Difference]: With dead ends: 910 [2019-11-15 23:48:06,535 INFO L226 Difference]: Without dead ends: 704 [2019-11-15 23:48:06,536 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:48:06,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-11-15 23:48:06,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2019-11-15 23:48:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-11-15 23:48:06,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 927 transitions. [2019-11-15 23:48:06,572 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 927 transitions. Word has length 31 [2019-11-15 23:48:06,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:06,572 INFO L462 AbstractCegarLoop]: Abstraction has 704 states and 927 transitions. [2019-11-15 23:48:06,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:48:06,572 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 927 transitions. [2019-11-15 23:48:06,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:48:06,573 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:06,573 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:06,574 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:06,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:06,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1153413219, now seen corresponding path program 1 times [2019-11-15 23:48:06,575 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:06,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125552908] [2019-11-15 23:48:06,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:06,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:06,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:06,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:06,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125552908] [2019-11-15 23:48:06,615 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:06,615 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:48:06,615 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324397044] [2019-11-15 23:48:06,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:48:06,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:06,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:48:06,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:48:06,616 INFO L87 Difference]: Start difference. First operand 704 states and 927 transitions. Second operand 6 states. [2019-11-15 23:48:06,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:06,931 INFO L93 Difference]: Finished difference Result 764 states and 990 transitions. [2019-11-15 23:48:06,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:48:06,932 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-15 23:48:06,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:06,936 INFO L225 Difference]: With dead ends: 764 [2019-11-15 23:48:06,936 INFO L226 Difference]: Without dead ends: 761 [2019-11-15 23:48:06,936 INFO L600 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-15 23:48:06,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-11-15 23:48:06,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 717. [2019-11-15 23:48:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-11-15 23:48:06,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 943 transitions. [2019-11-15 23:48:06,975 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 943 transitions. Word has length 32 [2019-11-15 23:48:06,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:06,975 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 943 transitions. [2019-11-15 23:48:06,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:48:06,975 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 943 transitions. [2019-11-15 23:48:06,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:48:06,976 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:06,976 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:06,977 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:06,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:06,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1153425135, now seen corresponding path program 1 times [2019-11-15 23:48:06,977 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:06,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971385430] [2019-11-15 23:48:06,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:06,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:06,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:07,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971385430] [2019-11-15 23:48:07,023 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:07,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:48:07,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996941402] [2019-11-15 23:48:07,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:48:07,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:07,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:48:07,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:48:07,025 INFO L87 Difference]: Start difference. First operand 717 states and 943 transitions. Second operand 6 states. [2019-11-15 23:48:07,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:07,388 INFO L93 Difference]: Finished difference Result 1397 states and 1826 transitions. [2019-11-15 23:48:07,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:48:07,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-15 23:48:07,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:07,393 INFO L225 Difference]: With dead ends: 1397 [2019-11-15 23:48:07,393 INFO L226 Difference]: Without dead ends: 1103 [2019-11-15 23:48:07,394 INFO L600 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-15 23:48:07,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2019-11-15 23:48:07,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 768. [2019-11-15 23:48:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-11-15 23:48:07,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1014 transitions. [2019-11-15 23:48:07,437 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1014 transitions. Word has length 32 [2019-11-15 23:48:07,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:07,437 INFO L462 AbstractCegarLoop]: Abstraction has 768 states and 1014 transitions. [2019-11-15 23:48:07,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:48:07,437 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1014 transitions. [2019-11-15 23:48:07,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:48:07,439 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:07,439 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:07,439 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:07,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:07,439 INFO L82 PathProgramCache]: Analyzing trace with hash -311747134, now seen corresponding path program 1 times [2019-11-15 23:48:07,439 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:07,440 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148960888] [2019-11-15 23:48:07,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:07,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:07,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:07,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:07,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148960888] [2019-11-15 23:48:07,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:07,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:48:07,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343962022] [2019-11-15 23:48:07,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:48:07,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:07,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:48:07,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:48:07,497 INFO L87 Difference]: Start difference. First operand 768 states and 1014 transitions. Second operand 6 states. [2019-11-15 23:48:07,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:07,583 INFO L93 Difference]: Finished difference Result 781 states and 1026 transitions. [2019-11-15 23:48:07,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:48:07,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-15 23:48:07,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:07,587 INFO L225 Difference]: With dead ends: 781 [2019-11-15 23:48:07,587 INFO L226 Difference]: Without dead ends: 760 [2019-11-15 23:48:07,587 INFO L600 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-15 23:48:07,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-11-15 23:48:07,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2019-11-15 23:48:07,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-11-15 23:48:07,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1003 transitions. [2019-11-15 23:48:07,640 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1003 transitions. Word has length 32 [2019-11-15 23:48:07,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:07,640 INFO L462 AbstractCegarLoop]: Abstraction has 760 states and 1003 transitions. [2019-11-15 23:48:07,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:48:07,641 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1003 transitions. [2019-11-15 23:48:07,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:48:07,644 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:07,644 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:07,644 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:07,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:07,645 INFO L82 PathProgramCache]: Analyzing trace with hash -909472821, now seen corresponding path program 1 times [2019-11-15 23:48:07,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:07,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427939228] [2019-11-15 23:48:07,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:07,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:07,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:07,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:07,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427939228] [2019-11-15 23:48:07,676 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:07,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:48:07,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114199034] [2019-11-15 23:48:07,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:48:07,676 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:07,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:48:07,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:48:07,677 INFO L87 Difference]: Start difference. First operand 760 states and 1003 transitions. Second operand 3 states. [2019-11-15 23:48:07,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:07,734 INFO L93 Difference]: Finished difference Result 943 states and 1238 transitions. [2019-11-15 23:48:07,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:48:07,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-15 23:48:07,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:07,738 INFO L225 Difference]: With dead ends: 943 [2019-11-15 23:48:07,739 INFO L226 Difference]: Without dead ends: 736 [2019-11-15 23:48:07,739 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:48:07,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-11-15 23:48:07,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 720. [2019-11-15 23:48:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-15 23:48:07,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 945 transitions. [2019-11-15 23:48:07,780 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 945 transitions. Word has length 32 [2019-11-15 23:48:07,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:07,780 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 945 transitions. [2019-11-15 23:48:07,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:48:07,780 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 945 transitions. [2019-11-15 23:48:07,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 23:48:07,782 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:07,782 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:07,782 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:07,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:07,783 INFO L82 PathProgramCache]: Analyzing trace with hash -353842307, now seen corresponding path program 1 times [2019-11-15 23:48:07,783 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:07,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593563099] [2019-11-15 23:48:07,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:07,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:07,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:07,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:07,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593563099] [2019-11-15 23:48:07,863 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:07,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:48:07,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061529624] [2019-11-15 23:48:07,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:48:07,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:07,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:48:07,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:48:07,864 INFO L87 Difference]: Start difference. First operand 720 states and 945 transitions. Second operand 5 states. [2019-11-15 23:48:07,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:07,971 INFO L93 Difference]: Finished difference Result 853 states and 1095 transitions. [2019-11-15 23:48:07,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:48:07,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-15 23:48:07,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:07,975 INFO L225 Difference]: With dead ends: 853 [2019-11-15 23:48:07,976 INFO L226 Difference]: Without dead ends: 832 [2019-11-15 23:48:07,976 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:48:07,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2019-11-15 23:48:08,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 723. [2019-11-15 23:48:08,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-11-15 23:48:08,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 948 transitions. [2019-11-15 23:48:08,013 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 948 transitions. Word has length 33 [2019-11-15 23:48:08,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:08,013 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 948 transitions. [2019-11-15 23:48:08,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:48:08,013 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 948 transitions. [2019-11-15 23:48:08,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 23:48:08,015 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:08,015 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:08,015 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:08,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:08,016 INFO L82 PathProgramCache]: Analyzing trace with hash -56726392, now seen corresponding path program 1 times [2019-11-15 23:48:08,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:08,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371196006] [2019-11-15 23:48:08,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:08,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:08,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:08,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371196006] [2019-11-15 23:48:08,044 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:08,044 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:48:08,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313959113] [2019-11-15 23:48:08,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:48:08,044 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:08,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:48:08,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:48:08,045 INFO L87 Difference]: Start difference. First operand 723 states and 948 transitions. Second operand 3 states. [2019-11-15 23:48:08,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:08,272 INFO L93 Difference]: Finished difference Result 874 states and 1127 transitions. [2019-11-15 23:48:08,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:48:08,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-15 23:48:08,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:08,277 INFO L225 Difference]: With dead ends: 874 [2019-11-15 23:48:08,277 INFO L226 Difference]: Without dead ends: 839 [2019-11-15 23:48:08,278 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:48:08,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-11-15 23:48:08,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 776. [2019-11-15 23:48:08,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-11-15 23:48:08,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1005 transitions. [2019-11-15 23:48:08,321 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1005 transitions. Word has length 33 [2019-11-15 23:48:08,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:08,322 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1005 transitions. [2019-11-15 23:48:08,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:48:08,322 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1005 transitions. [2019-11-15 23:48:08,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 23:48:08,323 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:08,324 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:08,324 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:08,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:08,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1516001350, now seen corresponding path program 1 times [2019-11-15 23:48:08,324 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:08,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352703131] [2019-11-15 23:48:08,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:08,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:08,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:08,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:08,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352703131] [2019-11-15 23:48:08,371 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:08,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:48:08,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151114975] [2019-11-15 23:48:08,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:48:08,372 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:08,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:48:08,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:48:08,372 INFO L87 Difference]: Start difference. First operand 776 states and 1005 transitions. Second operand 4 states. [2019-11-15 23:48:08,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:08,598 INFO L93 Difference]: Finished difference Result 799 states and 1028 transitions. [2019-11-15 23:48:08,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:48:08,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-15 23:48:08,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:08,603 INFO L225 Difference]: With dead ends: 799 [2019-11-15 23:48:08,603 INFO L226 Difference]: Without dead ends: 688 [2019-11-15 23:48:08,605 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:48:08,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2019-11-15 23:48:08,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 674. [2019-11-15 23:48:08,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-11-15 23:48:08,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 860 transitions. [2019-11-15 23:48:08,653 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 860 transitions. Word has length 33 [2019-11-15 23:48:08,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:08,653 INFO L462 AbstractCegarLoop]: Abstraction has 674 states and 860 transitions. [2019-11-15 23:48:08,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:48:08,653 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 860 transitions. [2019-11-15 23:48:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 23:48:08,655 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:08,655 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:08,655 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:08,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:08,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1819476696, now seen corresponding path program 1 times [2019-11-15 23:48:08,656 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:08,656 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792546099] [2019-11-15 23:48:08,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:08,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:08,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:08,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792546099] [2019-11-15 23:48:08,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:08,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 23:48:08,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050034382] [2019-11-15 23:48:08,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:48:08,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:08,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:48:08,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:48:08,792 INFO L87 Difference]: Start difference. First operand 674 states and 860 transitions. Second operand 10 states. [2019-11-15 23:48:09,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:09,981 INFO L93 Difference]: Finished difference Result 776 states and 977 transitions. [2019-11-15 23:48:09,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:48:09,982 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-11-15 23:48:09,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:09,985 INFO L225 Difference]: With dead ends: 776 [2019-11-15 23:48:09,985 INFO L226 Difference]: Without dead ends: 760 [2019-11-15 23:48:09,985 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:48:09,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-11-15 23:48:10,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 676. [2019-11-15 23:48:10,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-11-15 23:48:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 862 transitions. [2019-11-15 23:48:10,027 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 862 transitions. Word has length 33 [2019-11-15 23:48:10,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:10,027 INFO L462 AbstractCegarLoop]: Abstraction has 676 states and 862 transitions. [2019-11-15 23:48:10,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:48:10,027 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 862 transitions. [2019-11-15 23:48:10,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 23:48:10,028 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:10,028 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:10,028 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:10,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:10,029 INFO L82 PathProgramCache]: Analyzing trace with hash -471504232, now seen corresponding path program 1 times [2019-11-15 23:48:10,029 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:10,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57096057] [2019-11-15 23:48:10,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:10,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:10,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:10,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:10,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57096057] [2019-11-15 23:48:10,076 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:10,076 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:48:10,076 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023293983] [2019-11-15 23:48:10,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:48:10,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:10,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:48:10,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:48:10,077 INFO L87 Difference]: Start difference. First operand 676 states and 862 transitions. Second operand 5 states. [2019-11-15 23:48:10,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:10,412 INFO L93 Difference]: Finished difference Result 690 states and 874 transitions. [2019-11-15 23:48:10,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:48:10,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-15 23:48:10,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:10,416 INFO L225 Difference]: With dead ends: 690 [2019-11-15 23:48:10,416 INFO L226 Difference]: Without dead ends: 674 [2019-11-15 23:48:10,416 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:48:10,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-11-15 23:48:10,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 665. [2019-11-15 23:48:10,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-11-15 23:48:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 848 transitions. [2019-11-15 23:48:10,473 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 848 transitions. Word has length 33 [2019-11-15 23:48:10,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:10,473 INFO L462 AbstractCegarLoop]: Abstraction has 665 states and 848 transitions. [2019-11-15 23:48:10,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:48:10,473 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 848 transitions. [2019-11-15 23:48:10,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:48:10,475 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:10,475 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:10,476 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:10,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:10,476 INFO L82 PathProgramCache]: Analyzing trace with hash -935530627, now seen corresponding path program 1 times [2019-11-15 23:48:10,477 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:10,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28260508] [2019-11-15 23:48:10,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:10,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:10,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:10,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:10,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28260508] [2019-11-15 23:48:10,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:10,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:48:10,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150776508] [2019-11-15 23:48:10,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:48:10,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:10,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:48:10,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:48:10,575 INFO L87 Difference]: Start difference. First operand 665 states and 848 transitions. Second operand 9 states. [2019-11-15 23:48:11,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:11,421 INFO L93 Difference]: Finished difference Result 1076 states and 1357 transitions. [2019-11-15 23:48:11,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:48:11,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-15 23:48:11,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:11,425 INFO L225 Difference]: With dead ends: 1076 [2019-11-15 23:48:11,425 INFO L226 Difference]: Without dead ends: 1053 [2019-11-15 23:48:11,425 INFO L600 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-15 23:48:11,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-11-15 23:48:11,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 663. [2019-11-15 23:48:11,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-11-15 23:48:11,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 844 transitions. [2019-11-15 23:48:11,461 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 844 transitions. Word has length 35 [2019-11-15 23:48:11,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:11,461 INFO L462 AbstractCegarLoop]: Abstraction has 663 states and 844 transitions. [2019-11-15 23:48:11,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:48:11,462 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 844 transitions. [2019-11-15 23:48:11,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:48:11,462 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:11,462 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:11,463 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:11,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:11,463 INFO L82 PathProgramCache]: Analyzing trace with hash 750020413, now seen corresponding path program 1 times [2019-11-15 23:48:11,463 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:11,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641710132] [2019-11-15 23:48:11,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:11,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:11,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:11,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641710132] [2019-11-15 23:48:11,498 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:11,498 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:48:11,498 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609824923] [2019-11-15 23:48:11,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:48:11,498 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:11,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:48:11,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:48:11,499 INFO L87 Difference]: Start difference. First operand 663 states and 844 transitions. Second operand 4 states. [2019-11-15 23:48:11,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:11,685 INFO L93 Difference]: Finished difference Result 728 states and 926 transitions. [2019-11-15 23:48:11,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:48:11,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 23:48:11,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:11,688 INFO L225 Difference]: With dead ends: 728 [2019-11-15 23:48:11,688 INFO L226 Difference]: Without dead ends: 691 [2019-11-15 23:48:11,689 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:48:11,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-11-15 23:48:11,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 631. [2019-11-15 23:48:11,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-11-15 23:48:11,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 808 transitions. [2019-11-15 23:48:11,734 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 808 transitions. Word has length 35 [2019-11-15 23:48:11,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:11,735 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 808 transitions. [2019-11-15 23:48:11,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:48:11,735 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 808 transitions. [2019-11-15 23:48:11,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:48:11,736 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:11,736 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:11,737 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:11,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:11,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1333490113, now seen corresponding path program 1 times [2019-11-15 23:48:11,737 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:11,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322825916] [2019-11-15 23:48:11,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:11,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:11,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:11,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:11,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322825916] [2019-11-15 23:48:11,777 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:11,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:48:11,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100592414] [2019-11-15 23:48:11,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:48:11,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:11,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:48:11,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:48:11,778 INFO L87 Difference]: Start difference. First operand 631 states and 808 transitions. Second operand 5 states. [2019-11-15 23:48:12,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:12,008 INFO L93 Difference]: Finished difference Result 1371 states and 1763 transitions. [2019-11-15 23:48:12,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:48:12,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-15 23:48:12,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:12,012 INFO L225 Difference]: With dead ends: 1371 [2019-11-15 23:48:12,012 INFO L226 Difference]: Without dead ends: 1185 [2019-11-15 23:48:12,013 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:48:12,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-11-15 23:48:12,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 638. [2019-11-15 23:48:12,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-11-15 23:48:12,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 815 transitions. [2019-11-15 23:48:12,052 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 815 transitions. Word has length 35 [2019-11-15 23:48:12,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:12,052 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 815 transitions. [2019-11-15 23:48:12,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:48:12,052 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 815 transitions. [2019-11-15 23:48:12,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:48:12,053 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:12,053 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:12,054 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:12,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:12,054 INFO L82 PathProgramCache]: Analyzing trace with hash -901089383, now seen corresponding path program 1 times [2019-11-15 23:48:12,054 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:12,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401552504] [2019-11-15 23:48:12,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:12,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:12,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:12,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:12,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401552504] [2019-11-15 23:48:12,085 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:12,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:48:12,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562191027] [2019-11-15 23:48:12,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:48:12,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:12,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:48:12,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:48:12,086 INFO L87 Difference]: Start difference. First operand 638 states and 815 transitions. Second operand 3 states. [2019-11-15 23:48:12,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:12,153 INFO L93 Difference]: Finished difference Result 898 states and 1150 transitions. [2019-11-15 23:48:12,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:48:12,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-15 23:48:12,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:12,161 INFO L225 Difference]: With dead ends: 898 [2019-11-15 23:48:12,166 INFO L226 Difference]: Without dead ends: 699 [2019-11-15 23:48:12,167 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:48:12,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-11-15 23:48:12,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 626. [2019-11-15 23:48:12,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-11-15 23:48:12,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 797 transitions. [2019-11-15 23:48:12,211 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 797 transitions. Word has length 36 [2019-11-15 23:48:12,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:12,211 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 797 transitions. [2019-11-15 23:48:12,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:48:12,211 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 797 transitions. [2019-11-15 23:48:12,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 23:48:12,212 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:12,212 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:12,213 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:12,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:12,213 INFO L82 PathProgramCache]: Analyzing trace with hash -307255467, now seen corresponding path program 1 times [2019-11-15 23:48:12,213 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:12,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053678630] [2019-11-15 23:48:12,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:12,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:12,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:12,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-15 23:48:12,270 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053678630] [2019-11-15 23:48:12,270 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:12,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:48:12,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547202758] [2019-11-15 23:48:12,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:48:12,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:12,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:48:12,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:48:12,271 INFO L87 Difference]: Start difference. First operand 626 states and 797 transitions. Second operand 6 states. [2019-11-15 23:48:12,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:12,431 INFO L93 Difference]: Finished difference Result 725 states and 904 transitions. [2019-11-15 23:48:12,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:48:12,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-11-15 23:48:12,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:12,434 INFO L225 Difference]: With dead ends: 725 [2019-11-15 23:48:12,434 INFO L226 Difference]: Without dead ends: 688 [2019-11-15 23:48:12,434 INFO L600 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-15 23:48:12,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2019-11-15 23:48:12,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 619. [2019-11-15 23:48:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-11-15 23:48:12,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 787 transitions. [2019-11-15 23:48:12,480 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 787 transitions. Word has length 37 [2019-11-15 23:48:12,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:12,480 INFO L462 AbstractCegarLoop]: Abstraction has 619 states and 787 transitions. [2019-11-15 23:48:12,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:48:12,480 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 787 transitions. [2019-11-15 23:48:12,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 23:48:12,482 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:12,482 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:12,482 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:12,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:12,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1515937655, now seen corresponding path program 1 times [2019-11-15 23:48:12,483 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:12,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199214574] [2019-11-15 23:48:12,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:12,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:12,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:12,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:12,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199214574] [2019-11-15 23:48:12,517 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:12,517 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:48:12,517 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630378527] [2019-11-15 23:48:12,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:48:12,517 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:12,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:48:12,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:48:12,518 INFO L87 Difference]: Start difference. First operand 619 states and 787 transitions. Second operand 5 states. [2019-11-15 23:48:12,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:12,630 INFO L93 Difference]: Finished difference Result 648 states and 815 transitions. [2019-11-15 23:48:12,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:48:12,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-11-15 23:48:12,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:12,632 INFO L225 Difference]: With dead ends: 648 [2019-11-15 23:48:12,632 INFO L226 Difference]: Without dead ends: 631 [2019-11-15 23:48:12,632 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:48:12,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-11-15 23:48:12,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 618. [2019-11-15 23:48:12,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-11-15 23:48:12,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 785 transitions. [2019-11-15 23:48:12,675 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 785 transitions. Word has length 37 [2019-11-15 23:48:12,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:12,675 INFO L462 AbstractCegarLoop]: Abstraction has 618 states and 785 transitions. [2019-11-15 23:48:12,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:48:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 785 transitions. [2019-11-15 23:48:12,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 23:48:12,677 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:12,677 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:12,677 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:12,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:12,677 INFO L82 PathProgramCache]: Analyzing trace with hash -604679938, now seen corresponding path program 1 times [2019-11-15 23:48:12,678 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:12,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791754587] [2019-11-15 23:48:12,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:12,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:12,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:12,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:12,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791754587] [2019-11-15 23:48:12,719 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:12,719 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:48:12,719 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362045371] [2019-11-15 23:48:12,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:48:12,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:12,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:48:12,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:48:12,720 INFO L87 Difference]: Start difference. First operand 618 states and 785 transitions. Second operand 6 states. [2019-11-15 23:48:12,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:12,918 INFO L93 Difference]: Finished difference Result 657 states and 821 transitions. [2019-11-15 23:48:12,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:48:12,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-11-15 23:48:12,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:12,920 INFO L225 Difference]: With dead ends: 657 [2019-11-15 23:48:12,920 INFO L226 Difference]: Without dead ends: 623 [2019-11-15 23:48:12,920 INFO L600 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-15 23:48:12,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-11-15 23:48:12,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 602. [2019-11-15 23:48:12,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-11-15 23:48:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 765 transitions. [2019-11-15 23:48:12,955 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 765 transitions. Word has length 37 [2019-11-15 23:48:12,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:12,956 INFO L462 AbstractCegarLoop]: Abstraction has 602 states and 765 transitions. [2019-11-15 23:48:12,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:48:12,956 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 765 transitions. [2019-11-15 23:48:12,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 23:48:12,957 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:12,957 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:12,958 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:12,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:12,958 INFO L82 PathProgramCache]: Analyzing trace with hash 48742328, now seen corresponding path program 1 times [2019-11-15 23:48:12,958 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:12,959 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142636000] [2019-11-15 23:48:12,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:12,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:12,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:13,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:13,072 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142636000] [2019-11-15 23:48:13,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:13,073 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:48:13,073 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512502997] [2019-11-15 23:48:13,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:48:13,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:13,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:48:13,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:48:13,073 INFO L87 Difference]: Start difference. First operand 602 states and 765 transitions. Second operand 4 states. [2019-11-15 23:48:13,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:13,241 INFO L93 Difference]: Finished difference Result 798 states and 1014 transitions. [2019-11-15 23:48:13,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:48:13,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-15 23:48:13,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:13,243 INFO L225 Difference]: With dead ends: 798 [2019-11-15 23:48:13,244 INFO L226 Difference]: Without dead ends: 579 [2019-11-15 23:48:13,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:48:13,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-11-15 23:48:13,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 567. [2019-11-15 23:48:13,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-11-15 23:48:13,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 714 transitions. [2019-11-15 23:48:13,343 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 714 transitions. Word has length 37 [2019-11-15 23:48:13,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:13,344 INFO L462 AbstractCegarLoop]: Abstraction has 567 states and 714 transitions. [2019-11-15 23:48:13,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:48:13,344 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 714 transitions. [2019-11-15 23:48:13,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 23:48:13,345 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:13,345 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:13,346 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:13,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:13,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1967560492, now seen corresponding path program 1 times [2019-11-15 23:48:13,346 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:13,346 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534011348] [2019-11-15 23:48:13,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:13,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:13,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:13,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:13,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534011348] [2019-11-15 23:48:13,386 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:13,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:48:13,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887220079] [2019-11-15 23:48:13,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:48:13,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:13,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:48:13,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:48:13,387 INFO L87 Difference]: Start difference. First operand 567 states and 714 transitions. Second operand 4 states. [2019-11-15 23:48:13,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:13,628 INFO L93 Difference]: Finished difference Result 748 states and 947 transitions. [2019-11-15 23:48:13,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:48:13,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-15 23:48:13,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:13,630 INFO L225 Difference]: With dead ends: 748 [2019-11-15 23:48:13,630 INFO L226 Difference]: Without dead ends: 564 [2019-11-15 23:48:13,631 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:48:13,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-11-15 23:48:13,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-11-15 23:48:13,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-11-15 23:48:13,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 705 transitions. [2019-11-15 23:48:13,708 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 705 transitions. Word has length 38 [2019-11-15 23:48:13,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:13,708 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 705 transitions. [2019-11-15 23:48:13,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:48:13,708 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 705 transitions. [2019-11-15 23:48:13,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 23:48:13,709 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:13,709 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:13,710 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:13,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:13,710 INFO L82 PathProgramCache]: Analyzing trace with hash -436735014, now seen corresponding path program 1 times [2019-11-15 23:48:13,710 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:13,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266560127] [2019-11-15 23:48:13,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:13,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:13,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:13,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:13,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266560127] [2019-11-15 23:48:13,764 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:13,764 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:48:13,764 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513634175] [2019-11-15 23:48:13,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:48:13,764 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:13,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:48:13,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:48:13,765 INFO L87 Difference]: Start difference. First operand 564 states and 705 transitions. Second operand 5 states. [2019-11-15 23:48:13,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:13,893 INFO L93 Difference]: Finished difference Result 587 states and 725 transitions. [2019-11-15 23:48:13,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:48:13,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-15 23:48:13,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:13,895 INFO L225 Difference]: With dead ends: 587 [2019-11-15 23:48:13,895 INFO L226 Difference]: Without dead ends: 566 [2019-11-15 23:48:13,895 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:48:13,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-11-15 23:48:13,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 556. [2019-11-15 23:48:13,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-11-15 23:48:13,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 695 transitions. [2019-11-15 23:48:13,984 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 695 transitions. Word has length 41 [2019-11-15 23:48:13,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:13,985 INFO L462 AbstractCegarLoop]: Abstraction has 556 states and 695 transitions. [2019-11-15 23:48:13,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:48:13,985 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 695 transitions. [2019-11-15 23:48:13,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 23:48:13,986 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:13,986 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:13,987 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:13,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:13,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1643790660, now seen corresponding path program 1 times [2019-11-15 23:48:13,987 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:13,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263403236] [2019-11-15 23:48:13,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:13,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:13,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:14,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263403236] [2019-11-15 23:48:14,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:14,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:48:14,036 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798830485] [2019-11-15 23:48:14,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:48:14,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:14,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:48:14,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:48:14,036 INFO L87 Difference]: Start difference. First operand 556 states and 695 transitions. Second operand 4 states. [2019-11-15 23:48:14,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:14,134 INFO L93 Difference]: Finished difference Result 584 states and 724 transitions. [2019-11-15 23:48:14,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:48:14,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-11-15 23:48:14,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:14,136 INFO L225 Difference]: With dead ends: 584 [2019-11-15 23:48:14,136 INFO L226 Difference]: Without dead ends: 566 [2019-11-15 23:48:14,136 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:48:14,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-11-15 23:48:14,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 542. [2019-11-15 23:48:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-11-15 23:48:14,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 679 transitions. [2019-11-15 23:48:14,194 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 679 transitions. Word has length 41 [2019-11-15 23:48:14,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:14,194 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 679 transitions. [2019-11-15 23:48:14,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:48:14,194 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 679 transitions. [2019-11-15 23:48:14,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 23:48:14,195 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:14,195 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:14,196 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:14,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:14,196 INFO L82 PathProgramCache]: Analyzing trace with hash -147578755, now seen corresponding path program 1 times [2019-11-15 23:48:14,196 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:14,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237999321] [2019-11-15 23:48:14,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:14,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:14,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:14,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:14,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237999321] [2019-11-15 23:48:14,237 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:14,237 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:48:14,237 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000895538] [2019-11-15 23:48:14,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:48:14,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:14,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:48:14,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:48:14,238 INFO L87 Difference]: Start difference. First operand 542 states and 679 transitions. Second operand 3 states. [2019-11-15 23:48:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:14,431 INFO L93 Difference]: Finished difference Result 937 states and 1169 transitions. [2019-11-15 23:48:14,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:48:14,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-15 23:48:14,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:14,433 INFO L225 Difference]: With dead ends: 937 [2019-11-15 23:48:14,433 INFO L226 Difference]: Without dead ends: 756 [2019-11-15 23:48:14,434 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:48:14,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2019-11-15 23:48:14,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 545. [2019-11-15 23:48:14,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-11-15 23:48:14,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 682 transitions. [2019-11-15 23:48:14,491 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 682 transitions. Word has length 41 [2019-11-15 23:48:14,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:14,492 INFO L462 AbstractCegarLoop]: Abstraction has 545 states and 682 transitions. [2019-11-15 23:48:14,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:48:14,493 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 682 transitions. [2019-11-15 23:48:14,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 23:48:14,494 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:14,494 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:14,494 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:14,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:14,494 INFO L82 PathProgramCache]: Analyzing trace with hash 160458813, now seen corresponding path program 1 times [2019-11-15 23:48:14,495 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:14,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158359664] [2019-11-15 23:48:14,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:14,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:14,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:14,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:14,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158359664] [2019-11-15 23:48:14,554 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:14,554 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:48:14,554 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521288192] [2019-11-15 23:48:14,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:48:14,555 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:14,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:48:14,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:48:14,555 INFO L87 Difference]: Start difference. First operand 545 states and 682 transitions. Second operand 5 states. [2019-11-15 23:48:14,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:14,875 INFO L93 Difference]: Finished difference Result 922 states and 1139 transitions. [2019-11-15 23:48:14,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:48:14,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-15 23:48:14,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:14,878 INFO L225 Difference]: With dead ends: 922 [2019-11-15 23:48:14,878 INFO L226 Difference]: Without dead ends: 766 [2019-11-15 23:48:14,879 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:48:14,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2019-11-15 23:48:14,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 545. [2019-11-15 23:48:14,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-11-15 23:48:14,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 678 transitions. [2019-11-15 23:48:14,958 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 678 transitions. Word has length 41 [2019-11-15 23:48:14,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:14,958 INFO L462 AbstractCegarLoop]: Abstraction has 545 states and 678 transitions. [2019-11-15 23:48:14,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:48:14,959 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 678 transitions. [2019-11-15 23:48:14,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 23:48:14,960 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:14,960 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:14,960 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:14,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:14,961 INFO L82 PathProgramCache]: Analyzing trace with hash -693628121, now seen corresponding path program 1 times [2019-11-15 23:48:14,961 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:14,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585917856] [2019-11-15 23:48:14,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:14,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:14,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:15,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:15,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585917856] [2019-11-15 23:48:15,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:15,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:48:15,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002470152] [2019-11-15 23:48:15,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:48:15,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:15,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:48:15,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:48:15,008 INFO L87 Difference]: Start difference. First operand 545 states and 678 transitions. Second operand 4 states. [2019-11-15 23:48:15,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:15,160 INFO L93 Difference]: Finished difference Result 794 states and 966 transitions. [2019-11-15 23:48:15,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:48:15,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-15 23:48:15,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:15,162 INFO L225 Difference]: With dead ends: 794 [2019-11-15 23:48:15,162 INFO L226 Difference]: Without dead ends: 707 [2019-11-15 23:48:15,163 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:48:15,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-11-15 23:48:15,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 549. [2019-11-15 23:48:15,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-11-15 23:48:15,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 682 transitions. [2019-11-15 23:48:15,225 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 682 transitions. Word has length 42 [2019-11-15 23:48:15,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:15,225 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 682 transitions. [2019-11-15 23:48:15,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:48:15,225 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 682 transitions. [2019-11-15 23:48:15,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 23:48:15,227 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:15,227 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:15,227 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:15,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:15,228 INFO L82 PathProgramCache]: Analyzing trace with hash -81749273, now seen corresponding path program 1 times [2019-11-15 23:48:15,228 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:15,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025004447] [2019-11-15 23:48:15,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:15,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:15,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:15,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:15,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025004447] [2019-11-15 23:48:15,278 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:15,278 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:48:15,278 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396330678] [2019-11-15 23:48:15,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:48:15,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:15,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:48:15,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:48:15,279 INFO L87 Difference]: Start difference. First operand 549 states and 682 transitions. Second operand 7 states. [2019-11-15 23:48:15,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:15,464 INFO L93 Difference]: Finished difference Result 777 states and 942 transitions. [2019-11-15 23:48:15,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:48:15,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-11-15 23:48:15,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:15,466 INFO L225 Difference]: With dead ends: 777 [2019-11-15 23:48:15,466 INFO L226 Difference]: Without dead ends: 619 [2019-11-15 23:48:15,467 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:48:15,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-11-15 23:48:15,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 552. [2019-11-15 23:48:15,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-11-15 23:48:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 683 transitions. [2019-11-15 23:48:15,526 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 683 transitions. Word has length 42 [2019-11-15 23:48:15,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:15,526 INFO L462 AbstractCegarLoop]: Abstraction has 552 states and 683 transitions. [2019-11-15 23:48:15,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:48:15,526 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 683 transitions. [2019-11-15 23:48:15,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 23:48:15,527 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:15,527 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:15,528 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:15,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:15,528 INFO L82 PathProgramCache]: Analyzing trace with hash -822982435, now seen corresponding path program 1 times [2019-11-15 23:48:15,528 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:15,529 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257267723] [2019-11-15 23:48:15,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:15,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:15,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:15,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:15,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257267723] [2019-11-15 23:48:15,584 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:15,584 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:48:15,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722259831] [2019-11-15 23:48:15,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:48:15,584 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:15,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:48:15,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:48:15,585 INFO L87 Difference]: Start difference. First operand 552 states and 683 transitions. Second operand 7 states. [2019-11-15 23:48:15,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:15,884 INFO L93 Difference]: Finished difference Result 587 states and 716 transitions. [2019-11-15 23:48:15,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:48:15,884 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-11-15 23:48:15,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:15,885 INFO L225 Difference]: With dead ends: 587 [2019-11-15 23:48:15,885 INFO L226 Difference]: Without dead ends: 440 [2019-11-15 23:48:15,886 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:48:15,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-11-15 23:48:15,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 410. [2019-11-15 23:48:15,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-11-15 23:48:15,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 504 transitions. [2019-11-15 23:48:15,929 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 504 transitions. Word has length 42 [2019-11-15 23:48:15,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:15,930 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 504 transitions. [2019-11-15 23:48:15,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:48:15,930 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 504 transitions. [2019-11-15 23:48:15,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 23:48:15,931 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:15,931 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:15,931 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:15,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:15,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1536215993, now seen corresponding path program 1 times [2019-11-15 23:48:15,932 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:15,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121035588] [2019-11-15 23:48:15,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:15,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:15,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:15,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:15,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121035588] [2019-11-15 23:48:15,998 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:15,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:48:15,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882378905] [2019-11-15 23:48:15,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:48:15,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:15,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:48:15,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:48:15,999 INFO L87 Difference]: Start difference. First operand 410 states and 504 transitions. Second operand 5 states. [2019-11-15 23:48:16,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:16,212 INFO L93 Difference]: Finished difference Result 828 states and 1031 transitions. [2019-11-15 23:48:16,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:48:16,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-15 23:48:16,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:16,214 INFO L225 Difference]: With dead ends: 828 [2019-11-15 23:48:16,215 INFO L226 Difference]: Without dead ends: 698 [2019-11-15 23:48:16,216 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:48:16,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-11-15 23:48:16,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 410. [2019-11-15 23:48:16,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-11-15 23:48:16,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 503 transitions. [2019-11-15 23:48:16,261 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 503 transitions. Word has length 44 [2019-11-15 23:48:16,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:16,261 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 503 transitions. [2019-11-15 23:48:16,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:48:16,261 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 503 transitions. [2019-11-15 23:48:16,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 23:48:16,262 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:16,262 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:16,262 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:16,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:16,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1966977471, now seen corresponding path program 1 times [2019-11-15 23:48:16,263 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:16,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520703716] [2019-11-15 23:48:16,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:16,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:16,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:16,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:16,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520703716] [2019-11-15 23:48:16,336 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:16,336 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:48:16,336 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712709956] [2019-11-15 23:48:16,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:48:16,336 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:16,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:48:16,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:48:16,337 INFO L87 Difference]: Start difference. First operand 410 states and 503 transitions. Second operand 8 states. [2019-11-15 23:48:16,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:16,527 INFO L93 Difference]: Finished difference Result 425 states and 517 transitions. [2019-11-15 23:48:16,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:48:16,528 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-11-15 23:48:16,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:16,529 INFO L225 Difference]: With dead ends: 425 [2019-11-15 23:48:16,529 INFO L226 Difference]: Without dead ends: 402 [2019-11-15 23:48:16,530 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:48:16,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-11-15 23:48:16,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2019-11-15 23:48:16,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-11-15 23:48:16,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 493 transitions. [2019-11-15 23:48:16,573 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 493 transitions. Word has length 46 [2019-11-15 23:48:16,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:16,573 INFO L462 AbstractCegarLoop]: Abstraction has 402 states and 493 transitions. [2019-11-15 23:48:16,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:48:16,574 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 493 transitions. [2019-11-15 23:48:16,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 23:48:16,574 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:16,575 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:16,575 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:16,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:16,575 INFO L82 PathProgramCache]: Analyzing trace with hash -702658274, now seen corresponding path program 1 times [2019-11-15 23:48:16,576 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:16,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624454862] [2019-11-15 23:48:16,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:16,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:16,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:16,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:16,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624454862] [2019-11-15 23:48:16,609 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:16,609 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:48:16,609 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001448723] [2019-11-15 23:48:16,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:48:16,609 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:16,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:48:16,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:48:16,610 INFO L87 Difference]: Start difference. First operand 402 states and 493 transitions. Second operand 4 states. [2019-11-15 23:48:16,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:16,691 INFO L93 Difference]: Finished difference Result 507 states and 610 transitions. [2019-11-15 23:48:16,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:48:16,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-15 23:48:16,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:16,692 INFO L225 Difference]: With dead ends: 507 [2019-11-15 23:48:16,692 INFO L226 Difference]: Without dead ends: 464 [2019-11-15 23:48:16,693 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:48:16,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-11-15 23:48:16,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 401. [2019-11-15 23:48:16,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-11-15 23:48:16,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 491 transitions. [2019-11-15 23:48:16,736 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 491 transitions. Word has length 47 [2019-11-15 23:48:16,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:16,737 INFO L462 AbstractCegarLoop]: Abstraction has 401 states and 491 transitions. [2019-11-15 23:48:16,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:48:16,737 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 491 transitions. [2019-11-15 23:48:16,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 23:48:16,738 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:16,738 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:16,739 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:16,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:16,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1085716830, now seen corresponding path program 1 times [2019-11-15 23:48:16,739 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:16,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810542319] [2019-11-15 23:48:16,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:16,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:16,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:16,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-15 23:48:16,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810542319] [2019-11-15 23:48:16,801 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:16,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:48:16,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287405823] [2019-11-15 23:48:16,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:48:16,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:16,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:48:16,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:48:16,802 INFO L87 Difference]: Start difference. First operand 401 states and 491 transitions. Second operand 7 states. [2019-11-15 23:48:16,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:16,952 INFO L93 Difference]: Finished difference Result 481 states and 578 transitions. [2019-11-15 23:48:16,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:48:16,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-15 23:48:16,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:16,954 INFO L225 Difference]: With dead ends: 481 [2019-11-15 23:48:16,955 INFO L226 Difference]: Without dead ends: 394 [2019-11-15 23:48:16,956 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:48:16,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-11-15 23:48:16,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 382. [2019-11-15 23:48:16,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-15 23:48:17,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 468 transitions. [2019-11-15 23:48:17,000 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 468 transitions. Word has length 47 [2019-11-15 23:48:17,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:17,001 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 468 transitions. [2019-11-15 23:48:17,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:48:17,001 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 468 transitions. [2019-11-15 23:48:17,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 23:48:17,003 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:17,003 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:17,004 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:17,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:17,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1259536918, now seen corresponding path program 1 times [2019-11-15 23:48:17,004 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:17,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838787269] [2019-11-15 23:48:17,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:17,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:17,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:17,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838787269] [2019-11-15 23:48:17,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:17,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:48:17,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500941565] [2019-11-15 23:48:17,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:48:17,035 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:17,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:48:17,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:48:17,036 INFO L87 Difference]: Start difference. First operand 382 states and 468 transitions. Second operand 3 states. [2019-11-15 23:48:17,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:17,140 INFO L93 Difference]: Finished difference Result 515 states and 638 transitions. [2019-11-15 23:48:17,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:48:17,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-15 23:48:17,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:17,142 INFO L225 Difference]: With dead ends: 515 [2019-11-15 23:48:17,142 INFO L226 Difference]: Without dead ends: 344 [2019-11-15 23:48:17,142 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:48:17,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-11-15 23:48:17,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-11-15 23:48:17,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-11-15 23:48:17,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 419 transitions. [2019-11-15 23:48:17,180 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 419 transitions. Word has length 48 [2019-11-15 23:48:17,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:17,180 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 419 transitions. [2019-11-15 23:48:17,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:48:17,180 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 419 transitions. [2019-11-15 23:48:17,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 23:48:17,181 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:17,181 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:17,181 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:17,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:17,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1390297930, now seen corresponding path program 1 times [2019-11-15 23:48:17,182 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:17,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477380102] [2019-11-15 23:48:17,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:17,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:17,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:17,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:17,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477380102] [2019-11-15 23:48:17,278 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:17,278 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:48:17,278 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501861311] [2019-11-15 23:48:17,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:48:17,279 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:17,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:48:17,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:48:17,279 INFO L87 Difference]: Start difference. First operand 344 states and 419 transitions. Second operand 8 states. [2019-11-15 23:48:17,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:17,430 INFO L93 Difference]: Finished difference Result 356 states and 430 transitions. [2019-11-15 23:48:17,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:48:17,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-11-15 23:48:17,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:17,431 INFO L225 Difference]: With dead ends: 356 [2019-11-15 23:48:17,431 INFO L226 Difference]: Without dead ends: 298 [2019-11-15 23:48:17,432 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:48:17,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-15 23:48:17,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2019-11-15 23:48:17,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-15 23:48:17,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 361 transitions. [2019-11-15 23:48:17,466 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 361 transitions. Word has length 51 [2019-11-15 23:48:17,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:17,466 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 361 transitions. [2019-11-15 23:48:17,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:48:17,467 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 361 transitions. [2019-11-15 23:48:17,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:48:17,467 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:17,468 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:17,468 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:17,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:17,468 INFO L82 PathProgramCache]: Analyzing trace with hash -624384568, now seen corresponding path program 1 times [2019-11-15 23:48:17,468 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:17,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824914361] [2019-11-15 23:48:17,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:17,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:17,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:17,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:17,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824914361] [2019-11-15 23:48:17,516 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:17,517 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:48:17,517 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669555653] [2019-11-15 23:48:17,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:48:17,517 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:17,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:48:17,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:48:17,517 INFO L87 Difference]: Start difference. First operand 298 states and 361 transitions. Second operand 7 states. [2019-11-15 23:48:17,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:17,757 INFO L93 Difference]: Finished difference Result 422 states and 506 transitions. [2019-11-15 23:48:17,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:48:17,758 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-15 23:48:17,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:17,759 INFO L225 Difference]: With dead ends: 422 [2019-11-15 23:48:17,759 INFO L226 Difference]: Without dead ends: 404 [2019-11-15 23:48:17,759 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:48:17,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-11-15 23:48:17,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 298. [2019-11-15 23:48:17,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-15 23:48:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 360 transitions. [2019-11-15 23:48:17,798 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 360 transitions. Word has length 54 [2019-11-15 23:48:17,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:17,798 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 360 transitions. [2019-11-15 23:48:17,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:48:17,799 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 360 transitions. [2019-11-15 23:48:17,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 23:48:17,801 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:17,801 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:17,802 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:17,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:17,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1057733436, now seen corresponding path program 1 times [2019-11-15 23:48:17,802 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:17,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615340843] [2019-11-15 23:48:17,802 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:17,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:17,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:17,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:17,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615340843] [2019-11-15 23:48:17,825 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:17,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:48:17,825 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682681278] [2019-11-15 23:48:17,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:48:17,825 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:17,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:48:17,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:48:17,826 INFO L87 Difference]: Start difference. First operand 298 states and 360 transitions. Second operand 3 states. [2019-11-15 23:48:17,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:17,888 INFO L93 Difference]: Finished difference Result 535 states and 654 transitions. [2019-11-15 23:48:17,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:48:17,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-15 23:48:17,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:17,890 INFO L225 Difference]: With dead ends: 535 [2019-11-15 23:48:17,890 INFO L226 Difference]: Without dead ends: 352 [2019-11-15 23:48:17,890 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:48:17,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-11-15 23:48:17,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 298. [2019-11-15 23:48:17,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-15 23:48:17,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 357 transitions. [2019-11-15 23:48:17,929 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 357 transitions. Word has length 55 [2019-11-15 23:48:17,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:17,929 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 357 transitions. [2019-11-15 23:48:17,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:48:17,930 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 357 transitions. [2019-11-15 23:48:17,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 23:48:17,930 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:17,931 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:17,931 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:17,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:17,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1187342961, now seen corresponding path program 1 times [2019-11-15 23:48:17,932 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:17,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102650036] [2019-11-15 23:48:17,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:17,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:17,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:17,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:17,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102650036] [2019-11-15 23:48:17,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:17,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:48:17,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818221575] [2019-11-15 23:48:17,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:48:17,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:17,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:48:17,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:48:17,981 INFO L87 Difference]: Start difference. First operand 298 states and 357 transitions. Second operand 5 states. [2019-11-15 23:48:18,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:18,163 INFO L93 Difference]: Finished difference Result 306 states and 363 transitions. [2019-11-15 23:48:18,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:48:18,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-11-15 23:48:18,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:18,165 INFO L225 Difference]: With dead ends: 306 [2019-11-15 23:48:18,165 INFO L226 Difference]: Without dead ends: 302 [2019-11-15 23:48:18,165 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:48:18,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-15 23:48:18,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-11-15 23:48:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-15 23:48:18,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 356 transitions. [2019-11-15 23:48:18,205 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 356 transitions. Word has length 56 [2019-11-15 23:48:18,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:18,206 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 356 transitions. [2019-11-15 23:48:18,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:48:18,206 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 356 transitions. [2019-11-15 23:48:18,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 23:48:18,207 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:18,207 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:18,208 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:18,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:18,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1863906656, now seen corresponding path program 1 times [2019-11-15 23:48:18,208 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:18,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102466833] [2019-11-15 23:48:18,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:18,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:18,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:18,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:18,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102466833] [2019-11-15 23:48:18,247 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:18,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:48:18,247 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596766905] [2019-11-15 23:48:18,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:48:18,247 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:18,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:48:18,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:48:18,248 INFO L87 Difference]: Start difference. First operand 298 states and 356 transitions. Second operand 4 states. [2019-11-15 23:48:18,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:18,383 INFO L93 Difference]: Finished difference Result 302 states and 359 transitions. [2019-11-15 23:48:18,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:48:18,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-15 23:48:18,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:18,385 INFO L225 Difference]: With dead ends: 302 [2019-11-15 23:48:18,385 INFO L226 Difference]: Without dead ends: 284 [2019-11-15 23:48:18,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:48:18,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-11-15 23:48:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2019-11-15 23:48:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-11-15 23:48:18,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 340 transitions. [2019-11-15 23:48:18,425 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 340 transitions. Word has length 57 [2019-11-15 23:48:18,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:18,425 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 340 transitions. [2019-11-15 23:48:18,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:48:18,425 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 340 transitions. [2019-11-15 23:48:18,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 23:48:18,426 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:18,426 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:18,427 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:48:18,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:18,427 INFO L82 PathProgramCache]: Analyzing trace with hash -576201386, now seen corresponding path program 1 times [2019-11-15 23:48:18,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:18,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811113856] [2019-11-15 23:48:18,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:18,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:18,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:48:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:48:18,521 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:48:18,522 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:48:18,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:48:18 BoogieIcfgContainer [2019-11-15 23:48:18,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:48:18,658 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:48:18,659 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:48:18,659 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:48:18,659 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:47:57" (3/4) ... [2019-11-15 23:48:18,661 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:48:18,807 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bcf0b99c-209d-4ebb-9352-40d4a7a37154/bin/uautomizer/witness.graphml [2019-11-15 23:48:18,807 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:48:18,810 INFO L168 Benchmark]: Toolchain (without parser) took 24260.14 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 741.3 MB). Free memory was 938.0 MB in the beginning and 1.3 GB in the end (delta: -340.9 MB). Peak memory consumption was 400.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:48:18,810 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:48:18,811 INFO L168 Benchmark]: CACSL2BoogieTranslator took 616.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:48:18,811 INFO L168 Benchmark]: Boogie Procedure Inliner took 161.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:48:18,811 INFO L168 Benchmark]: Boogie Preprocessor took 97.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:48:18,812 INFO L168 Benchmark]: RCFGBuilder took 1921.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 897.3 MB in the end (delta: 196.2 MB). Peak memory consumption was 196.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:48:18,812 INFO L168 Benchmark]: TraceAbstraction took 21309.93 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 603.5 MB). Free memory was 897.3 MB in the beginning and 1.3 GB in the end (delta: -405.2 MB). Peak memory consumption was 198.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:48:18,812 INFO L168 Benchmark]: Witness Printer took 149.06 ms. Allocated memory is still 1.8 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:48:18,814 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 616.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 161.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 97.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1921.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 897.3 MB in the end (delta: 196.2 MB). Peak memory consumption was 196.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21309.93 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 603.5 MB). Free memory was 897.3 MB in the beginning and 1.3 GB in the end (delta: -405.2 MB). Peak memory consumption was 198.3 MB. Max. memory is 11.5 GB. * Witness Printer took 149.06 ms. Allocated memory is still 1.8 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 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: 21.2s, OverallIterations: 58, TraceHistogramMax: 1, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 30824 SDtfs, 20140 SDslu, 66794 SDs, 0 SdLazy, 10004 SolverSat, 695 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 407 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.5s 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.5s AutomataMinimizationTime, 57 MinimizatonAttempts, 3830 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s 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...