./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6c315d77-b1cd-4619-9dd1-51962c60f8b1/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6c315d77-b1cd-4619-9dd1-51962c60f8b1/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6c315d77-b1cd-4619-9dd1-51962c60f8b1/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6c315d77-b1cd-4619-9dd1-51962c60f8b1/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6c315d77-b1cd-4619-9dd1-51962c60f8b1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6c315d77-b1cd-4619-9dd1-51962c60f8b1/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 600447986a0d0a3d94421aa90c6997a7dd1eb35a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-10-22 11:23:54,026 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:23:54,028 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:23:54,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:23:54,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:23:54,038 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:23:54,039 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:23:54,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:23:54,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:23:54,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:23:54,043 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:23:54,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:23:54,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:23:54,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:23:54,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:23:54,047 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:23:54,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:23:54,049 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:23:54,051 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:23:54,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:23:54,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:23:54,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:23:54,056 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:23:54,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:23:54,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:23:54,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:23:54,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:23:54,060 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:23:54,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:23:54,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:23:54,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:23:54,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:23:54,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:23:54,064 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:23:54,065 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:23:54,065 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:23:54,066 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:23:54,066 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:23:54,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:23:54,067 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:23:54,068 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:23:54,069 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6c315d77-b1cd-4619-9dd1-51962c60f8b1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:23:54,081 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:23:54,082 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:23:54,082 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:23:54,083 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:23:54,083 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:23:54,083 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:23:54,083 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:23:54,083 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:23:54,083 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:23:54,083 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:23:54,084 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:23:54,084 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:23:54,084 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:23:54,084 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:23:54,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:23:54,085 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:23:54,085 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:23:54,085 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:23:54,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:23:54,086 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:23:54,086 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:23:54,086 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:23:54,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:23:54,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:23:54,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:23:54,086 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:23:54,087 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:23:54,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:23:54,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:23:54,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:23:54,087 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:23:54,087 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:23:54,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:23:54,088 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:23:54,088 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:23:54,088 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_6c315d77-b1cd-4619-9dd1-51962c60f8b1/bin/utaipan 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 -> Taipan 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 -> 600447986a0d0a3d94421aa90c6997a7dd1eb35a [2019-10-22 11:23:54,112 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:23:54,122 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:23:54,125 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:23:54,127 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:23:54,127 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:23:54,128 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6c315d77-b1cd-4619-9dd1-51962c60f8b1/bin/utaipan/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c [2019-10-22 11:23:54,181 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c315d77-b1cd-4619-9dd1-51962c60f8b1/bin/utaipan/data/f65ed18ed/db8dd5961bc8443eaa0ae6dc2869c231/FLAG76511dcd5 [2019-10-22 11:23:54,596 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:23:54,596 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6c315d77-b1cd-4619-9dd1-51962c60f8b1/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c [2019-10-22 11:23:54,610 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c315d77-b1cd-4619-9dd1-51962c60f8b1/bin/utaipan/data/f65ed18ed/db8dd5961bc8443eaa0ae6dc2869c231/FLAG76511dcd5 [2019-10-22 11:23:54,623 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6c315d77-b1cd-4619-9dd1-51962c60f8b1/bin/utaipan/data/f65ed18ed/db8dd5961bc8443eaa0ae6dc2869c231 [2019-10-22 11:23:54,626 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:23:54,627 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:23:54,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:54,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:23:54,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:23:54,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:54" (1/1) ... [2019-10-22 11:23:54,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ca44468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:54, skipping insertion in model container [2019-10-22 11:23:54,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:54" (1/1) ... [2019-10-22 11:23:54,644 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:23:54,686 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:23:55,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:55,078 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:23:55,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:55,192 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:23:55,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:55 WrapperNode [2019-10-22 11:23:55,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:55,194 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:55,194 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:23:55,194 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:23:55,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:55" (1/1) ... [2019-10-22 11:23:55,220 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:55" (1/1) ... [2019-10-22 11:23:55,328 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:55,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:23:55,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:23:55,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:23:55,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:55" (1/1) ... [2019-10-22 11:23:55,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:55" (1/1) ... [2019-10-22 11:23:55,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:55" (1/1) ... [2019-10-22 11:23:55,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:55" (1/1) ... [2019-10-22 11:23:55,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:55" (1/1) ... [2019-10-22 11:23:55,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:55" (1/1) ... [2019-10-22 11:23:55,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:55" (1/1) ... [2019-10-22 11:23:55,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:23:55,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:23:55,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:23:55,433 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:23:55,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c315d77-b1cd-4619-9dd1-51962c60f8b1/bin/utaipan/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-10-22 11:23:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:23:55,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:23:55,724 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:23:55,734 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:23:55,740 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:23:55,744 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:23:55,745 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:23:55,747 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:23:55,753 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:23:55,759 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:23:55,761 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:23:55,761 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:23:55,764 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:23:55,769 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:23:55,770 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:23:55,771 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:23:55,772 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:23:55,777 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:23:55,780 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:23:55,786 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:23:55,787 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:23:55,792 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:23:55,796 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:23:55,798 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:23:55,798 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:23:55,800 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:23:56,621 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume !false; [2019-10-22 11:23:56,621 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##415: assume false; [2019-10-22 11:23:56,621 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##445: assume false; [2019-10-22 11:23:56,622 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##290: assume false; [2019-10-22 11:23:56,622 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##291: assume !false; [2019-10-22 11:23:56,622 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##490: assume !false; [2019-10-22 11:23:56,622 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##269: assume false; [2019-10-22 11:23:56,622 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##270: assume !false; [2019-10-22 11:23:56,622 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##446: assume !false; [2019-10-22 11:23:56,622 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##209: assume false; [2019-10-22 11:23:56,622 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##210: assume !false; [2019-10-22 11:23:56,623 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2019-10-22 11:23:56,623 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2019-10-22 11:23:56,623 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##470: assume false; [2019-10-22 11:23:56,623 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##232: assume false; [2019-10-22 11:23:56,623 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##471: assume !false; [2019-10-22 11:23:56,625 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##233: assume !false; [2019-10-22 11:23:56,625 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##242: assume !false; [2019-10-22 11:23:56,626 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##241: assume false; [2019-10-22 11:23:56,626 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##489: assume false; [2019-10-22 11:23:56,626 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##246: assume !false; [2019-10-22 11:23:56,626 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##245: assume false; [2019-10-22 11:23:56,626 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-22 11:23:56,626 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-22 11:23:56,626 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume !false; [2019-10-22 11:23:56,627 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume false; [2019-10-22 11:23:56,627 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##175: assume !false; [2019-10-22 11:23:56,627 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##174: assume false; [2019-10-22 11:23:56,627 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##180: assume false; [2019-10-22 11:23:56,627 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##181: assume !false; [2019-10-22 11:23:56,627 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !false; [2019-10-22 11:23:56,627 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume false; [2019-10-22 11:23:56,628 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume false; [2019-10-22 11:23:56,628 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !false; [2019-10-22 11:23:56,628 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##34: assume false; [2019-10-22 11:23:56,628 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##138: assume !false; [2019-10-22 11:23:56,628 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##393: assume false; [2019-10-22 11:23:56,628 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2019-10-22 11:23:56,628 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##394: assume !false; [2019-10-22 11:23:56,632 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2019-10-22 11:23:56,632 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##164: assume !false; [2019-10-22 11:23:56,632 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume false; [2019-10-22 11:23:56,632 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##329: assume false; [2019-10-22 11:23:56,633 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##330: assume !false; [2019-10-22 11:23:56,633 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##108: assume !false; [2019-10-22 11:23:56,633 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##107: assume false; [2019-10-22 11:23:56,633 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##364: assume !false; [2019-10-22 11:23:56,633 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##363: assume false; [2019-10-22 11:23:56,634 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:23:56,635 INFO L284 CfgBuilder]: Removed 207 assume(true) statements. [2019-10-22 11:23:56,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:56 BoogieIcfgContainer [2019-10-22 11:23:56,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:23:56,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:23:56,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:23:56,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:23:56,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:23:54" (1/3) ... [2019-10-22 11:23:56,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@99e2608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:56, skipping insertion in model container [2019-10-22 11:23:56,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:55" (2/3) ... [2019-10-22 11:23:56,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@99e2608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:56, skipping insertion in model container [2019-10-22 11:23:56,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:56" (3/3) ... [2019-10-22 11:23:56,644 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-1.c [2019-10-22 11:23:56,654 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:23:56,665 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2019-10-22 11:23:56,675 INFO L249 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2019-10-22 11:23:56,709 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:23:56,710 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:23:56,710 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:23:56,710 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:23:56,710 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:23:56,710 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:23:56,710 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:23:56,710 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:23:56,733 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states. [2019-10-22 11:23:56,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:23:56,739 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:56,739 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:56,742 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:56,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:56,748 INFO L82 PathProgramCache]: Analyzing trace with hash 660910296, now seen corresponding path program 1 times [2019-10-22 11:23:56,756 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:56,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521930187] [2019-10-22 11:23:56,757 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:56,757 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:56,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:56,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:56,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521930187] [2019-10-22 11:23:56,909 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:56,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:56,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611329301] [2019-10-22 11:23:56,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:56,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:56,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:56,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:56,931 INFO L87 Difference]: Start difference. First operand 421 states. Second operand 3 states. [2019-10-22 11:23:57,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:57,027 INFO L93 Difference]: Finished difference Result 763 states and 1090 transitions. [2019-10-22 11:23:57,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:57,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-22 11:23:57,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:57,048 INFO L225 Difference]: With dead ends: 763 [2019-10-22 11:23:57,049 INFO L226 Difference]: Without dead ends: 416 [2019-10-22 11:23:57,052 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-10-22 11:23:57,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-10-22 11:23:57,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2019-10-22 11:23:57,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-10-22 11:23:57,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 546 transitions. [2019-10-22 11:23:57,117 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 546 transitions. Word has length 11 [2019-10-22 11:23:57,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:57,118 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 546 transitions. [2019-10-22 11:23:57,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:57,118 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 546 transitions. [2019-10-22 11:23:57,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:23:57,119 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:57,119 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:57,120 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:57,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:57,121 INFO L82 PathProgramCache]: Analyzing trace with hash -32433196, now seen corresponding path program 1 times [2019-10-22 11:23:57,121 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:57,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312181086] [2019-10-22 11:23:57,121 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:57,121 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:57,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:57,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:57,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312181086] [2019-10-22 11:23:57,200 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:57,200 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:57,200 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918173131] [2019-10-22 11:23:57,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:57,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:57,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:57,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:57,203 INFO L87 Difference]: Start difference. First operand 416 states and 546 transitions. Second operand 3 states. [2019-10-22 11:23:57,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:57,494 INFO L93 Difference]: Finished difference Result 714 states and 941 transitions. [2019-10-22 11:23:57,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:57,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-22 11:23:57,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:57,498 INFO L225 Difference]: With dead ends: 714 [2019-10-22 11:23:57,498 INFO L226 Difference]: Without dead ends: 547 [2019-10-22 11:23:57,499 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-10-22 11:23:57,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-10-22 11:23:57,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 521. [2019-10-22 11:23:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2019-10-22 11:23:57,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 697 transitions. [2019-10-22 11:23:57,539 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 697 transitions. Word has length 13 [2019-10-22 11:23:57,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:57,539 INFO L462 AbstractCegarLoop]: Abstraction has 521 states and 697 transitions. [2019-10-22 11:23:57,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:57,540 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 697 transitions. [2019-10-22 11:23:57,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:23:57,540 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:57,540 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:57,542 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:57,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:57,546 INFO L82 PathProgramCache]: Analyzing trace with hash 563627937, now seen corresponding path program 1 times [2019-10-22 11:23:57,546 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:57,546 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188894407] [2019-10-22 11:23:57,547 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:57,547 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:57,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:57,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188894407] [2019-10-22 11:23:57,637 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:57,637 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:57,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511287869] [2019-10-22 11:23:57,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:57,638 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:57,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:57,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:57,639 INFO L87 Difference]: Start difference. First operand 521 states and 697 transitions. Second operand 3 states. [2019-10-22 11:23:57,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:57,698 INFO L93 Difference]: Finished difference Result 1000 states and 1335 transitions. [2019-10-22 11:23:57,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:57,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-22 11:23:57,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:57,701 INFO L225 Difference]: With dead ends: 1000 [2019-10-22 11:23:57,701 INFO L226 Difference]: Without dead ends: 690 [2019-10-22 11:23:57,703 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-10-22 11:23:57,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-10-22 11:23:57,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 519. [2019-10-22 11:23:57,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-10-22 11:23:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 696 transitions. [2019-10-22 11:23:57,733 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 696 transitions. Word has length 16 [2019-10-22 11:23:57,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:57,733 INFO L462 AbstractCegarLoop]: Abstraction has 519 states and 696 transitions. [2019-10-22 11:23:57,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:57,733 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 696 transitions. [2019-10-22 11:23:57,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:23:57,735 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:57,735 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-10-22 11:23:57,735 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:57,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:57,736 INFO L82 PathProgramCache]: Analyzing trace with hash 6806604, now seen corresponding path program 1 times [2019-10-22 11:23:57,736 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:57,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913757540] [2019-10-22 11:23:57,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:57,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:57,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:57,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:57,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913757540] [2019-10-22 11:23:57,803 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:57,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:57,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639634710] [2019-10-22 11:23:57,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:57,804 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:57,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:57,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:57,805 INFO L87 Difference]: Start difference. First operand 519 states and 696 transitions. Second operand 3 states. [2019-10-22 11:23:57,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:57,848 INFO L93 Difference]: Finished difference Result 601 states and 797 transitions. [2019-10-22 11:23:57,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:57,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 11:23:57,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:57,851 INFO L225 Difference]: With dead ends: 601 [2019-10-22 11:23:57,851 INFO L226 Difference]: Without dead ends: 578 [2019-10-22 11:23:57,852 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-10-22 11:23:57,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-10-22 11:23:57,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 537. [2019-10-22 11:23:57,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-10-22 11:23:57,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 727 transitions. [2019-10-22 11:23:57,883 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 727 transitions. Word has length 19 [2019-10-22 11:23:57,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:57,884 INFO L462 AbstractCegarLoop]: Abstraction has 537 states and 727 transitions. [2019-10-22 11:23:57,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:57,884 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 727 transitions. [2019-10-22 11:23:57,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:23:57,886 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:57,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] [2019-10-22 11:23:57,887 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:57,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:57,887 INFO L82 PathProgramCache]: Analyzing trace with hash -450647822, now seen corresponding path program 1 times [2019-10-22 11:23:57,887 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:57,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924449078] [2019-10-22 11:23:57,888 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:57,888 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:57,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:57,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:57,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924449078] [2019-10-22 11:23:57,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:57,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:57,955 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290533434] [2019-10-22 11:23:57,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:57,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:57,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:57,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:57,956 INFO L87 Difference]: Start difference. First operand 537 states and 727 transitions. Second operand 3 states. [2019-10-22 11:23:58,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:58,260 INFO L93 Difference]: Finished difference Result 732 states and 987 transitions. [2019-10-22 11:23:58,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:58,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-22 11:23:58,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:58,262 INFO L225 Difference]: With dead ends: 732 [2019-10-22 11:23:58,263 INFO L226 Difference]: Without dead ends: 724 [2019-10-22 11:23:58,263 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:58,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-10-22 11:23:58,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 555. [2019-10-22 11:23:58,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-22 11:23:58,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 754 transitions. [2019-10-22 11:23:58,288 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 754 transitions. Word has length 22 [2019-10-22 11:23:58,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:58,289 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 754 transitions. [2019-10-22 11:23:58,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:58,289 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 754 transitions. [2019-10-22 11:23:58,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:23:58,290 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:58,290 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:58,292 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:58,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:58,292 INFO L82 PathProgramCache]: Analyzing trace with hash 364241657, now seen corresponding path program 1 times [2019-10-22 11:23:58,293 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:58,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511223467] [2019-10-22 11:23:58,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:58,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:58,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:58,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-10-22 11:23:58,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511223467] [2019-10-22 11:23:58,337 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:58,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:58,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369571953] [2019-10-22 11:23:58,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:58,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:58,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:58,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:58,338 INFO L87 Difference]: Start difference. First operand 555 states and 754 transitions. Second operand 3 states. [2019-10-22 11:23:58,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:58,497 INFO L93 Difference]: Finished difference Result 590 states and 798 transitions. [2019-10-22 11:23:58,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:58,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-22 11:23:58,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:58,500 INFO L225 Difference]: With dead ends: 590 [2019-10-22 11:23:58,500 INFO L226 Difference]: Without dead ends: 585 [2019-10-22 11:23:58,501 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-10-22 11:23:58,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-10-22 11:23:58,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 582. [2019-10-22 11:23:58,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-22 11:23:58,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 790 transitions. [2019-10-22 11:23:58,525 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 790 transitions. Word has length 22 [2019-10-22 11:23:58,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:58,525 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 790 transitions. [2019-10-22 11:23:58,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:58,525 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 790 transitions. [2019-10-22 11:23:58,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:23:58,526 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:58,526 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-10-22 11:23:58,527 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:58,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:58,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1092839096, now seen corresponding path program 1 times [2019-10-22 11:23:58,527 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:58,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97862769] [2019-10-22 11:23:58,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:58,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:58,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:58,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:58,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97862769] [2019-10-22 11:23:58,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:58,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:23:58,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66120805] [2019-10-22 11:23:58,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:23:58,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:58,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:23:58,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:23:58,605 INFO L87 Difference]: Start difference. First operand 582 states and 790 transitions. Second operand 7 states. [2019-10-22 11:23:59,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:59,088 INFO L93 Difference]: Finished difference Result 898 states and 1197 transitions. [2019-10-22 11:23:59,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:23:59,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-10-22 11:23:59,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:59,091 INFO L225 Difference]: With dead ends: 898 [2019-10-22 11:23:59,091 INFO L226 Difference]: Without dead ends: 637 [2019-10-22 11:23:59,092 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-10-22 11:23:59,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-22 11:23:59,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 565. [2019-10-22 11:23:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-10-22 11:23:59,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 754 transitions. [2019-10-22 11:23:59,124 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 754 transitions. Word has length 23 [2019-10-22 11:23:59,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:59,124 INFO L462 AbstractCegarLoop]: Abstraction has 565 states and 754 transitions. [2019-10-22 11:23:59,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:23:59,125 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 754 transitions. [2019-10-22 11:23:59,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:23:59,126 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:59,126 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-10-22 11:23:59,126 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:59,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:59,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1575831316, now seen corresponding path program 1 times [2019-10-22 11:23:59,127 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:59,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900202499] [2019-10-22 11:23:59,127 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:59,127 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:59,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:59,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:59,168 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900202499] [2019-10-22 11:23:59,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:59,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:59,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678828773] [2019-10-22 11:23:59,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:59,169 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:59,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:59,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:59,170 INFO L87 Difference]: Start difference. First operand 565 states and 754 transitions. Second operand 4 states. [2019-10-22 11:23:59,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:59,228 INFO L93 Difference]: Finished difference Result 578 states and 768 transitions. [2019-10-22 11:23:59,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:59,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-10-22 11:23:59,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:59,230 INFO L225 Difference]: With dead ends: 578 [2019-10-22 11:23:59,231 INFO L226 Difference]: Without dead ends: 563 [2019-10-22 11:23:59,231 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-10-22 11:23:59,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-10-22 11:23:59,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2019-10-22 11:23:59,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-22 11:23:59,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 751 transitions. [2019-10-22 11:23:59,259 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 751 transitions. Word has length 23 [2019-10-22 11:23:59,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:59,259 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 751 transitions. [2019-10-22 11:23:59,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:59,259 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 751 transitions. [2019-10-22 11:23:59,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:23:59,260 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:59,260 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:59,260 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:59,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:59,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1184010678, now seen corresponding path program 1 times [2019-10-22 11:23:59,261 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:59,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120119937] [2019-10-22 11:23:59,261 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:59,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:59,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:59,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:59,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120119937] [2019-10-22 11:23:59,284 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:59,284 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:59,285 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138705375] [2019-10-22 11:23:59,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:59,285 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:59,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:59,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:59,285 INFO L87 Difference]: Start difference. First operand 563 states and 751 transitions. Second operand 3 states. [2019-10-22 11:23:59,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:59,444 INFO L93 Difference]: Finished difference Result 563 states and 751 transitions. [2019-10-22 11:23:59,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:59,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-22 11:23:59,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:59,447 INFO L225 Difference]: With dead ends: 563 [2019-10-22 11:23:59,447 INFO L226 Difference]: Without dead ends: 551 [2019-10-22 11:23:59,447 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-10-22 11:23:59,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-10-22 11:23:59,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-10-22 11:23:59,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-10-22 11:23:59,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 738 transitions. [2019-10-22 11:23:59,481 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 738 transitions. Word has length 25 [2019-10-22 11:23:59,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:59,481 INFO L462 AbstractCegarLoop]: Abstraction has 551 states and 738 transitions. [2019-10-22 11:23:59,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:59,481 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 738 transitions. [2019-10-22 11:23:59,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 11:23:59,482 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:59,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] [2019-10-22 11:23:59,483 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:59,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:59,483 INFO L82 PathProgramCache]: Analyzing trace with hash -944626100, now seen corresponding path program 1 times [2019-10-22 11:23:59,483 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:59,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230747134] [2019-10-22 11:23:59,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:59,484 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:59,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:59,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230747134] [2019-10-22 11:23:59,528 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:59,528 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:59,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538967802] [2019-10-22 11:23:59,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:59,529 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:59,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:59,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:59,529 INFO L87 Difference]: Start difference. First operand 551 states and 738 transitions. Second operand 3 states. [2019-10-22 11:23:59,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:59,692 INFO L93 Difference]: Finished difference Result 759 states and 1016 transitions. [2019-10-22 11:23:59,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:59,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-22 11:23:59,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:59,694 INFO L225 Difference]: With dead ends: 759 [2019-10-22 11:23:59,694 INFO L226 Difference]: Without dead ends: 553 [2019-10-22 11:23:59,695 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-10-22 11:23:59,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-10-22 11:23:59,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2019-10-22 11:23:59,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-10-22 11:23:59,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 741 transitions. [2019-10-22 11:23:59,726 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 741 transitions. Word has length 28 [2019-10-22 11:23:59,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:59,727 INFO L462 AbstractCegarLoop]: Abstraction has 553 states and 741 transitions. [2019-10-22 11:23:59,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:59,727 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 741 transitions. [2019-10-22 11:23:59,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 11:23:59,727 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:59,728 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-10-22 11:23:59,728 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:59,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:59,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1312752221, now seen corresponding path program 1 times [2019-10-22 11:23:59,729 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:59,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801453136] [2019-10-22 11:23:59,729 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:59,729 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:59,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:59,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:59,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801453136] [2019-10-22 11:23:59,767 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:59,767 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:59,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457111050] [2019-10-22 11:23:59,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:59,768 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:59,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:59,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:59,768 INFO L87 Difference]: Start difference. First operand 553 states and 741 transitions. Second operand 3 states. [2019-10-22 11:23:59,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:59,823 INFO L93 Difference]: Finished difference Result 733 states and 975 transitions. [2019-10-22 11:23:59,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:59,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-22 11:23:59,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:59,826 INFO L225 Difference]: With dead ends: 733 [2019-10-22 11:23:59,826 INFO L226 Difference]: Without dead ends: 529 [2019-10-22 11:23:59,827 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-10-22 11:23:59,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-10-22 11:23:59,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 513. [2019-10-22 11:23:59,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2019-10-22 11:23:59,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 683 transitions. [2019-10-22 11:23:59,862 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 683 transitions. Word has length 29 [2019-10-22 11:23:59,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:59,862 INFO L462 AbstractCegarLoop]: Abstraction has 513 states and 683 transitions. [2019-10-22 11:23:59,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:59,863 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 683 transitions. [2019-10-22 11:23:59,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:23:59,864 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:59,864 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-10-22 11:23:59,865 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:59,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:59,865 INFO L82 PathProgramCache]: Analyzing trace with hash 259846608, now seen corresponding path program 1 times [2019-10-22 11:23:59,865 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:59,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727830305] [2019-10-22 11:23:59,866 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:59,866 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:59,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:59,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:59,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727830305] [2019-10-22 11:23:59,918 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:59,918 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:59,918 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683322937] [2019-10-22 11:23:59,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:59,919 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:59,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:59,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:59,919 INFO L87 Difference]: Start difference. First operand 513 states and 683 transitions. Second operand 5 states. [2019-10-22 11:24:00,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:00,269 INFO L93 Difference]: Finished difference Result 1324 states and 1762 transitions. [2019-10-22 11:24:00,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:24:00,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-22 11:24:00,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:00,273 INFO L225 Difference]: With dead ends: 1324 [2019-10-22 11:24:00,273 INFO L226 Difference]: Without dead ends: 1052 [2019-10-22 11:24:00,274 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-10-22 11:24:00,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-10-22 11:24:00,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 552. [2019-10-22 11:24:00,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-10-22 11:24:00,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 741 transitions. [2019-10-22 11:24:00,309 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 741 transitions. Word has length 32 [2019-10-22 11:24:00,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:00,310 INFO L462 AbstractCegarLoop]: Abstraction has 552 states and 741 transitions. [2019-10-22 11:24:00,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:00,310 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 741 transitions. [2019-10-22 11:24:00,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:24:00,311 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:00,311 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-10-22 11:24:00,312 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:00,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:00,315 INFO L82 PathProgramCache]: Analyzing trace with hash 255000751, now seen corresponding path program 1 times [2019-10-22 11:24:00,315 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:00,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246234700] [2019-10-22 11:24:00,315 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:00,315 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:00,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:00,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:00,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246234700] [2019-10-22 11:24:00,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:00,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:00,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723353265] [2019-10-22 11:24:00,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:00,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:00,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:00,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:00,355 INFO L87 Difference]: Start difference. First operand 552 states and 741 transitions. Second operand 5 states. [2019-10-22 11:24:00,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:00,437 INFO L93 Difference]: Finished difference Result 572 states and 763 transitions. [2019-10-22 11:24:00,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:00,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-22 11:24:00,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:00,439 INFO L225 Difference]: With dead ends: 572 [2019-10-22 11:24:00,440 INFO L226 Difference]: Without dead ends: 555 [2019-10-22 11:24:00,440 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-10-22 11:24:00,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-22 11:24:00,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 552. [2019-10-22 11:24:00,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-10-22 11:24:00,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 740 transitions. [2019-10-22 11:24:00,473 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 740 transitions. Word has length 32 [2019-10-22 11:24:00,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:00,473 INFO L462 AbstractCegarLoop]: Abstraction has 552 states and 740 transitions. [2019-10-22 11:24:00,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:00,473 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 740 transitions. [2019-10-22 11:24:00,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 11:24:00,474 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:00,474 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:00,475 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:00,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:00,475 INFO L82 PathProgramCache]: Analyzing trace with hash 175699761, now seen corresponding path program 1 times [2019-10-22 11:24:00,475 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:00,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65255809] [2019-10-22 11:24:00,475 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:00,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:00,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:00,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:00,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65255809] [2019-10-22 11:24:00,514 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:00,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:00,514 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012529507] [2019-10-22 11:24:00,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:00,515 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:00,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:00,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:00,515 INFO L87 Difference]: Start difference. First operand 552 states and 740 transitions. Second operand 3 states. [2019-10-22 11:24:00,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:00,565 INFO L93 Difference]: Finished difference Result 812 states and 1079 transitions. [2019-10-22 11:24:00,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:00,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-22 11:24:00,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:00,568 INFO L225 Difference]: With dead ends: 812 [2019-10-22 11:24:00,568 INFO L226 Difference]: Without dead ends: 613 [2019-10-22 11:24:00,569 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-10-22 11:24:00,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-22 11:24:00,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 540. [2019-10-22 11:24:00,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-10-22 11:24:00,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 722 transitions. [2019-10-22 11:24:00,599 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 722 transitions. Word has length 33 [2019-10-22 11:24:00,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:00,600 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 722 transitions. [2019-10-22 11:24:00,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:00,600 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 722 transitions. [2019-10-22 11:24:00,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 11:24:00,601 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:00,601 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-10-22 11:24:00,602 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:00,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:00,602 INFO L82 PathProgramCache]: Analyzing trace with hash -744399452, now seen corresponding path program 1 times [2019-10-22 11:24:00,602 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:00,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043845968] [2019-10-22 11:24:00,602 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:00,602 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:00,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:00,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:00,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043845968] [2019-10-22 11:24:00,627 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:00,627 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:00,627 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078600379] [2019-10-22 11:24:00,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:00,628 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:00,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:00,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:00,628 INFO L87 Difference]: Start difference. First operand 540 states and 722 transitions. Second operand 3 states. [2019-10-22 11:24:00,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:00,813 INFO L93 Difference]: Finished difference Result 716 states and 944 transitions. [2019-10-22 11:24:00,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:00,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-22 11:24:00,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:00,817 INFO L225 Difference]: With dead ends: 716 [2019-10-22 11:24:00,817 INFO L226 Difference]: Without dead ends: 703 [2019-10-22 11:24:00,817 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-10-22 11:24:00,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-10-22 11:24:00,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 587. [2019-10-22 11:24:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-22 11:24:00,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 779 transitions. [2019-10-22 11:24:00,852 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 779 transitions. Word has length 33 [2019-10-22 11:24:00,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:00,853 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 779 transitions. [2019-10-22 11:24:00,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:00,853 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 779 transitions. [2019-10-22 11:24:00,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 11:24:00,855 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:00,855 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:00,855 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:00,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:00,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1784201236, now seen corresponding path program 1 times [2019-10-22 11:24:00,856 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:00,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802921924] [2019-10-22 11:24:00,856 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:00,856 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:00,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:00,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:00,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802921924] [2019-10-22 11:24:00,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:00,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:00,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182398687] [2019-10-22 11:24:00,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:00,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:00,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:00,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:00,888 INFO L87 Difference]: Start difference. First operand 587 states and 779 transitions. Second operand 3 states. [2019-10-22 11:24:00,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:00,932 INFO L93 Difference]: Finished difference Result 625 states and 824 transitions. [2019-10-22 11:24:00,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:00,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-22 11:24:00,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:00,934 INFO L225 Difference]: With dead ends: 625 [2019-10-22 11:24:00,935 INFO L226 Difference]: Without dead ends: 581 [2019-10-22 11:24:00,935 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-10-22 11:24:00,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-10-22 11:24:00,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 577. [2019-10-22 11:24:00,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-22 11:24:00,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 758 transitions. [2019-10-22 11:24:00,968 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 758 transitions. Word has length 34 [2019-10-22 11:24:00,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:00,968 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 758 transitions. [2019-10-22 11:24:00,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:00,968 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 758 transitions. [2019-10-22 11:24:00,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 11:24:00,969 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:00,969 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:00,970 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:00,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:00,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1583955411, now seen corresponding path program 1 times [2019-10-22 11:24:00,971 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:00,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382525395] [2019-10-22 11:24:00,971 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:00,971 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:00,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:01,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:01,015 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382525395] [2019-10-22 11:24:01,015 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:01,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:01,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240577249] [2019-10-22 11:24:01,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:01,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:01,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:01,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:01,016 INFO L87 Difference]: Start difference. First operand 577 states and 758 transitions. Second operand 5 states. [2019-10-22 11:24:01,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:01,316 INFO L93 Difference]: Finished difference Result 601 states and 778 transitions. [2019-10-22 11:24:01,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:01,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-10-22 11:24:01,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:01,319 INFO L225 Difference]: With dead ends: 601 [2019-10-22 11:24:01,319 INFO L226 Difference]: Without dead ends: 589 [2019-10-22 11:24:01,319 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-10-22 11:24:01,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-22 11:24:01,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 577. [2019-10-22 11:24:01,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-22 11:24:01,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 756 transitions. [2019-10-22 11:24:01,354 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 756 transitions. Word has length 34 [2019-10-22 11:24:01,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:01,355 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 756 transitions. [2019-10-22 11:24:01,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:01,355 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 756 transitions. [2019-10-22 11:24:01,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 11:24:01,356 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:01,356 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:01,356 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:01,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:01,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1675490409, now seen corresponding path program 1 times [2019-10-22 11:24:01,357 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:01,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205370600] [2019-10-22 11:24:01,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:01,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:01,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:01,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:01,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205370600] [2019-10-22 11:24:01,379 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:01,379 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:01,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460830082] [2019-10-22 11:24:01,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:01,379 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:01,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:01,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:01,380 INFO L87 Difference]: Start difference. First operand 577 states and 756 transitions. Second operand 3 states. [2019-10-22 11:24:01,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:01,439 INFO L93 Difference]: Finished difference Result 820 states and 1058 transitions. [2019-10-22 11:24:01,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:01,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-22 11:24:01,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:01,442 INFO L225 Difference]: With dead ends: 820 [2019-10-22 11:24:01,442 INFO L226 Difference]: Without dead ends: 699 [2019-10-22 11:24:01,442 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-10-22 11:24:01,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-10-22 11:24:01,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 578. [2019-10-22 11:24:01,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-10-22 11:24:01,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 757 transitions. [2019-10-22 11:24:01,478 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 757 transitions. Word has length 34 [2019-10-22 11:24:01,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:01,478 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 757 transitions. [2019-10-22 11:24:01,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:01,478 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 757 transitions. [2019-10-22 11:24:01,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 11:24:01,479 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:01,479 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:01,480 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:01,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:01,480 INFO L82 PathProgramCache]: Analyzing trace with hash -930533145, now seen corresponding path program 1 times [2019-10-22 11:24:01,480 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:01,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560705333] [2019-10-22 11:24:01,480 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:01,480 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:01,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:01,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:01,530 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560705333] [2019-10-22 11:24:01,530 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:01,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:01,530 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413146257] [2019-10-22 11:24:01,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:01,531 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:01,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:01,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:01,531 INFO L87 Difference]: Start difference. First operand 578 states and 757 transitions. Second operand 4 states. [2019-10-22 11:24:01,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:01,612 INFO L93 Difference]: Finished difference Result 1366 states and 1768 transitions. [2019-10-22 11:24:01,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:01,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-10-22 11:24:01,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:01,615 INFO L225 Difference]: With dead ends: 1366 [2019-10-22 11:24:01,616 INFO L226 Difference]: Without dead ends: 797 [2019-10-22 11:24:01,617 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:01,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-10-22 11:24:01,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 670. [2019-10-22 11:24:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-10-22 11:24:01,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 871 transitions. [2019-10-22 11:24:01,670 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 871 transitions. Word has length 34 [2019-10-22 11:24:01,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:01,670 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 871 transitions. [2019-10-22 11:24:01,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:01,670 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 871 transitions. [2019-10-22 11:24:01,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 11:24:01,671 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:01,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, 1, 1, 1, 1] [2019-10-22 11:24:01,672 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:01,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:01,672 INFO L82 PathProgramCache]: Analyzing trace with hash -992572759, now seen corresponding path program 1 times [2019-10-22 11:24:01,673 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:01,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274745517] [2019-10-22 11:24:01,673 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:01,673 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:01,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24: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-10-22 11:24:01,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274745517] [2019-10-22 11:24:01,780 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:01,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:01,780 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343825321] [2019-10-22 11:24:01,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:01,781 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:01,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:01,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:01,781 INFO L87 Difference]: Start difference. First operand 670 states and 871 transitions. Second operand 4 states. [2019-10-22 11:24:01,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:01,943 INFO L93 Difference]: Finished difference Result 859 states and 1114 transitions. [2019-10-22 11:24:01,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:01,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-10-22 11:24:01,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:01,946 INFO L225 Difference]: With dead ends: 859 [2019-10-22 11:24:01,946 INFO L226 Difference]: Without dead ends: 640 [2019-10-22 11:24:01,947 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-10-22 11:24:01,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-10-22 11:24:02,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 635. [2019-10-22 11:24:02,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-22 11:24:02,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 820 transitions. [2019-10-22 11:24:02,009 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 820 transitions. Word has length 34 [2019-10-22 11:24:02,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:02,009 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 820 transitions. [2019-10-22 11:24:02,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:02,010 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 820 transitions. [2019-10-22 11:24:02,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 11:24:02,010 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:02,010 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-10-22 11:24:02,011 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:02,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:02,011 INFO L82 PathProgramCache]: Analyzing trace with hash -19558115, now seen corresponding path program 1 times [2019-10-22 11:24:02,011 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:02,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268417614] [2019-10-22 11:24:02,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:02,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:02,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:02,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:02,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268417614] [2019-10-22 11:24:02,049 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:02,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:02,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796521818] [2019-10-22 11:24:02,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:02,050 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:02,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:02,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:02,050 INFO L87 Difference]: Start difference. First operand 635 states and 820 transitions. Second operand 4 states. [2019-10-22 11:24:02,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:02,274 INFO L93 Difference]: Finished difference Result 647 states and 830 transitions. [2019-10-22 11:24:02,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:02,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-10-22 11:24:02,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:02,276 INFO L225 Difference]: With dead ends: 647 [2019-10-22 11:24:02,276 INFO L226 Difference]: Without dead ends: 580 [2019-10-22 11:24:02,277 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-10-22 11:24:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-10-22 11:24:02,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-10-22 11:24:02,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-10-22 11:24:02,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 741 transitions. [2019-10-22 11:24:02,335 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 741 transitions. Word has length 35 [2019-10-22 11:24:02,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:02,335 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 741 transitions. [2019-10-22 11:24:02,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:02,335 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 741 transitions. [2019-10-22 11:24:02,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 11:24:02,336 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:02,336 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-10-22 11:24:02,336 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:02,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:02,337 INFO L82 PathProgramCache]: Analyzing trace with hash 813687739, now seen corresponding path program 1 times [2019-10-22 11:24:02,337 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:02,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40736841] [2019-10-22 11:24:02,337 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:02,337 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:02,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:02,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-10-22 11:24:02,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40736841] [2019-10-22 11:24:02,371 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:02,372 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:02,372 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936137947] [2019-10-22 11:24:02,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:02,372 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:02,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:02,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:02,373 INFO L87 Difference]: Start difference. First operand 580 states and 741 transitions. Second operand 4 states. [2019-10-22 11:24:02,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:02,549 INFO L93 Difference]: Finished difference Result 653 states and 823 transitions. [2019-10-22 11:24:02,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:02,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-10-22 11:24:02,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:02,553 INFO L225 Difference]: With dead ends: 653 [2019-10-22 11:24:02,553 INFO L226 Difference]: Without dead ends: 564 [2019-10-22 11:24:02,554 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-10-22 11:24:02,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-10-22 11:24:02,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 546. [2019-10-22 11:24:02,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-10-22 11:24:02,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 684 transitions. [2019-10-22 11:24:02,606 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 684 transitions. Word has length 35 [2019-10-22 11:24:02,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:02,606 INFO L462 AbstractCegarLoop]: Abstraction has 546 states and 684 transitions. [2019-10-22 11:24:02,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:02,606 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 684 transitions. [2019-10-22 11:24:02,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 11:24:02,607 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:02,607 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-10-22 11:24:02,607 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:02,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:02,608 INFO L82 PathProgramCache]: Analyzing trace with hash -759040003, now seen corresponding path program 1 times [2019-10-22 11:24:02,608 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:02,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238661278] [2019-10-22 11:24:02,608 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:02,608 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:02,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:02,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238661278] [2019-10-22 11:24:02,648 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:02,648 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:02,648 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189319651] [2019-10-22 11:24:02,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:02,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:02,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:02,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:02,649 INFO L87 Difference]: Start difference. First operand 546 states and 684 transitions. Second operand 3 states. [2019-10-22 11:24:02,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:02,795 INFO L93 Difference]: Finished difference Result 569 states and 703 transitions. [2019-10-22 11:24:02,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:02,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-22 11:24:02,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:02,797 INFO L225 Difference]: With dead ends: 569 [2019-10-22 11:24:02,797 INFO L226 Difference]: Without dead ends: 549 [2019-10-22 11:24:02,798 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-10-22 11:24:02,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-10-22 11:24:02,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 540. [2019-10-22 11:24:02,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-10-22 11:24:02,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 673 transitions. [2019-10-22 11:24:02,849 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 673 transitions. Word has length 35 [2019-10-22 11:24:02,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:02,849 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 673 transitions. [2019-10-22 11:24:02,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:02,849 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 673 transitions. [2019-10-22 11:24:02,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 11:24:02,850 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:02,850 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-10-22 11:24:02,850 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:02,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:02,851 INFO L82 PathProgramCache]: Analyzing trace with hash 111409610, now seen corresponding path program 1 times [2019-10-22 11:24:02,851 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:02,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307566616] [2019-10-22 11:24:02,852 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:02,852 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:02,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:02,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:02,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307566616] [2019-10-22 11:24:02,894 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:02,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:02,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990603693] [2019-10-22 11:24:02,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:02,895 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:02,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:02,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:02,895 INFO L87 Difference]: Start difference. First operand 540 states and 673 transitions. Second operand 4 states. [2019-10-22 11:24:03,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:03,078 INFO L93 Difference]: Finished difference Result 721 states and 907 transitions. [2019-10-22 11:24:03,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:03,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-10-22 11:24:03,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:03,081 INFO L225 Difference]: With dead ends: 721 [2019-10-22 11:24:03,081 INFO L226 Difference]: Without dead ends: 537 [2019-10-22 11:24:03,082 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-10-22 11:24:03,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-10-22 11:24:03,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2019-10-22 11:24:03,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-10-22 11:24:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 664 transitions. [2019-10-22 11:24:03,133 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 664 transitions. Word has length 35 [2019-10-22 11:24:03,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:03,134 INFO L462 AbstractCegarLoop]: Abstraction has 537 states and 664 transitions. [2019-10-22 11:24:03,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 664 transitions. [2019-10-22 11:24:03,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 11:24:03,135 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:03,135 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-10-22 11:24:03,135 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:03,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:03,135 INFO L82 PathProgramCache]: Analyzing trace with hash 2063815052, now seen corresponding path program 1 times [2019-10-22 11:24:03,136 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:03,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568157153] [2019-10-22 11:24:03,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:03,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:03,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:03,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:03,179 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568157153] [2019-10-22 11:24:03,179 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:03,179 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:03,179 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998739666] [2019-10-22 11:24:03,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:03,180 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:03,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:03,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:03,180 INFO L87 Difference]: Start difference. First operand 537 states and 664 transitions. Second operand 4 states. [2019-10-22 11:24:03,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:03,351 INFO L93 Difference]: Finished difference Result 550 states and 674 transitions. [2019-10-22 11:24:03,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:03,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-10-22 11:24:03,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:03,353 INFO L225 Difference]: With dead ends: 550 [2019-10-22 11:24:03,353 INFO L226 Difference]: Without dead ends: 541 [2019-10-22 11:24:03,354 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-10-22 11:24:03,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-10-22 11:24:03,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 537. [2019-10-22 11:24:03,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-10-22 11:24:03,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 662 transitions. [2019-10-22 11:24:03,405 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 662 transitions. Word has length 36 [2019-10-22 11:24:03,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:03,406 INFO L462 AbstractCegarLoop]: Abstraction has 537 states and 662 transitions. [2019-10-22 11:24:03,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:03,406 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 662 transitions. [2019-10-22 11:24:03,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 11:24:03,406 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:03,407 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-10-22 11:24:03,407 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:03,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:03,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2037812492, now seen corresponding path program 1 times [2019-10-22 11:24:03,408 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:03,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424356082] [2019-10-22 11:24:03,408 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:03,408 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:03,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:03,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:03,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424356082] [2019-10-22 11:24:03,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:03,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:24:03,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997272165] [2019-10-22 11:24:03,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:24:03,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:03,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:24:03,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:03,498 INFO L87 Difference]: Start difference. First operand 537 states and 662 transitions. Second operand 7 states. [2019-10-22 11:24:03,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:03,882 INFO L93 Difference]: Finished difference Result 784 states and 953 transitions. [2019-10-22 11:24:03,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:24:03,882 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-10-22 11:24:03,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:03,885 INFO L225 Difference]: With dead ends: 784 [2019-10-22 11:24:03,885 INFO L226 Difference]: Without dead ends: 764 [2019-10-22 11:24:03,886 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:24:03,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-10-22 11:24:03,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 536. [2019-10-22 11:24:03,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-10-22 11:24:03,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 660 transitions. [2019-10-22 11:24:03,940 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 660 transitions. Word has length 36 [2019-10-22 11:24:03,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:03,940 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 660 transitions. [2019-10-22 11:24:03,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:24:03,940 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 660 transitions. [2019-10-22 11:24:03,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-22 11:24:03,941 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:03,941 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-10-22 11:24:03,942 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:03,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:03,942 INFO L82 PathProgramCache]: Analyzing trace with hash -463076180, now seen corresponding path program 1 times [2019-10-22 11:24:03,942 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:03,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029528616] [2019-10-22 11:24:03,944 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:03,944 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:03,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:03,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:03,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029528616] [2019-10-22 11:24:03,984 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:03,984 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:03,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890866540] [2019-10-22 11:24:03,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:03,985 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:03,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:03,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:03,985 INFO L87 Difference]: Start difference. First operand 536 states and 660 transitions. Second operand 4 states. [2019-10-22 11:24:04,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:04,139 INFO L93 Difference]: Finished difference Result 549 states and 670 transitions. [2019-10-22 11:24:04,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:04,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-10-22 11:24:04,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:04,141 INFO L225 Difference]: With dead ends: 549 [2019-10-22 11:24:04,141 INFO L226 Difference]: Without dead ends: 540 [2019-10-22 11:24:04,141 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-10-22 11:24:04,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-10-22 11:24:04,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 536. [2019-10-22 11:24:04,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-10-22 11:24:04,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 658 transitions. [2019-10-22 11:24:04,193 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 658 transitions. Word has length 37 [2019-10-22 11:24:04,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:04,194 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 658 transitions. [2019-10-22 11:24:04,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:04,194 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 658 transitions. [2019-10-22 11:24:04,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-22 11:24:04,195 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:04,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] [2019-10-22 11:24:04,195 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:04,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:04,196 INFO L82 PathProgramCache]: Analyzing trace with hash -187254176, now seen corresponding path program 1 times [2019-10-22 11:24:04,196 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:04,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905417748] [2019-10-22 11:24:04,196 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:04,196 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:04,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:04,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905417748] [2019-10-22 11:24:04,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:04,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:24:04,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387698254] [2019-10-22 11:24:04,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:24:04,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:04,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:24:04,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:24:04,257 INFO L87 Difference]: Start difference. First operand 536 states and 658 transitions. Second operand 6 states. [2019-10-22 11:24:04,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:04,519 INFO L93 Difference]: Finished difference Result 554 states and 674 transitions. [2019-10-22 11:24:04,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:24:04,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-10-22 11:24:04,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:04,521 INFO L225 Difference]: With dead ends: 554 [2019-10-22 11:24:04,521 INFO L226 Difference]: Without dead ends: 551 [2019-10-22 11:24:04,522 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-10-22 11:24:04,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-10-22 11:24:04,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 542. [2019-10-22 11:24:04,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-10-22 11:24:04,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 664 transitions. [2019-10-22 11:24:04,576 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 664 transitions. Word has length 37 [2019-10-22 11:24:04,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:04,576 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 664 transitions. [2019-10-22 11:24:04,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:24:04,576 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 664 transitions. [2019-10-22 11:24:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-22 11:24:04,577 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:04,577 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:04,578 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:04,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:04,578 INFO L82 PathProgramCache]: Analyzing trace with hash -187266092, now seen corresponding path program 1 times [2019-10-22 11:24:04,578 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:04,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797896883] [2019-10-22 11:24:04,578 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:04,579 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:04,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:04,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:04,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797896883] [2019-10-22 11:24:04,678 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:04,678 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 11:24:04,678 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751129862] [2019-10-22 11:24:04,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:24:04,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:04,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:24:04,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:24:04,679 INFO L87 Difference]: Start difference. First operand 542 states and 664 transitions. Second operand 10 states. [2019-10-22 11:24:05,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:05,498 INFO L93 Difference]: Finished difference Result 820 states and 999 transitions. [2019-10-22 11:24:05,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:24:05,499 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-10-22 11:24:05,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:05,500 INFO L225 Difference]: With dead ends: 820 [2019-10-22 11:24:05,500 INFO L226 Difference]: Without dead ends: 803 [2019-10-22 11:24:05,501 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:24:05,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2019-10-22 11:24:05,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 595. [2019-10-22 11:24:05,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-22 11:24:05,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 721 transitions. [2019-10-22 11:24:05,563 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 721 transitions. Word has length 37 [2019-10-22 11:24:05,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:05,563 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 721 transitions. [2019-10-22 11:24:05,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:24:05,563 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 721 transitions. [2019-10-22 11:24:05,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-22 11:24:05,565 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:05,565 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-10-22 11:24:05,566 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:05,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:05,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1498284948, now seen corresponding path program 1 times [2019-10-22 11:24:05,566 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:05,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512065475] [2019-10-22 11:24:05,566 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:05,566 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:05,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:05,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:05,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512065475] [2019-10-22 11:24:05,612 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:05,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:05,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845911368] [2019-10-22 11:24:05,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:05,613 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:05,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:05,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:05,613 INFO L87 Difference]: Start difference. First operand 595 states and 721 transitions. Second operand 5 states. [2019-10-22 11:24:05,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:05,827 INFO L93 Difference]: Finished difference Result 604 states and 728 transitions. [2019-10-22 11:24:05,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:05,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-10-22 11:24:05,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:05,829 INFO L225 Difference]: With dead ends: 604 [2019-10-22 11:24:05,829 INFO L226 Difference]: Without dead ends: 581 [2019-10-22 11:24:05,830 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:05,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-10-22 11:24:05,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 523. [2019-10-22 11:24:05,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-10-22 11:24:05,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 642 transitions. [2019-10-22 11:24:05,894 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 642 transitions. Word has length 37 [2019-10-22 11:24:05,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:05,894 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 642 transitions. [2019-10-22 11:24:05,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:05,895 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 642 transitions. [2019-10-22 11:24:05,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-22 11:24:05,937 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:05,937 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:05,937 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:05,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:05,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1481841291, now seen corresponding path program 1 times [2019-10-22 11:24:05,937 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:05,938 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99313281] [2019-10-22 11:24:05,938 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:05,938 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:05,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:05,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:05,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99313281] [2019-10-22 11:24:05,973 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:05,973 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:05,974 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771978724] [2019-10-22 11:24:05,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:05,974 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:05,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:05,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:05,974 INFO L87 Difference]: Start difference. First operand 523 states and 642 transitions. Second operand 4 states. [2019-10-22 11:24:06,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:06,044 INFO L93 Difference]: Finished difference Result 541 states and 658 transitions. [2019-10-22 11:24:06,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:06,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-10-22 11:24:06,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:06,046 INFO L225 Difference]: With dead ends: 541 [2019-10-22 11:24:06,046 INFO L226 Difference]: Without dead ends: 520 [2019-10-22 11:24:06,047 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-10-22 11:24:06,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-10-22 11:24:06,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 506. [2019-10-22 11:24:06,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-10-22 11:24:06,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 622 transitions. [2019-10-22 11:24:06,095 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 622 transitions. Word has length 38 [2019-10-22 11:24:06,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:06,095 INFO L462 AbstractCegarLoop]: Abstraction has 506 states and 622 transitions. [2019-10-22 11:24:06,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:06,095 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 622 transitions. [2019-10-22 11:24:06,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-22 11:24:06,096 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:06,096 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-10-22 11:24:06,096 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:06,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:06,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1021756590, now seen corresponding path program 1 times [2019-10-22 11:24:06,097 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:06,097 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085429412] [2019-10-22 11:24:06,097 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:06,097 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:06,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:06,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085429412] [2019-10-22 11:24:06,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:06,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:06,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250452554] [2019-10-22 11:24:06,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:06,117 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:06,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:06,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:06,118 INFO L87 Difference]: Start difference. First operand 506 states and 622 transitions. Second operand 3 states. [2019-10-22 11:24:06,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:06,253 INFO L93 Difference]: Finished difference Result 870 states and 1065 transitions. [2019-10-22 11:24:06,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:06,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-22 11:24:06,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:06,256 INFO L225 Difference]: With dead ends: 870 [2019-10-22 11:24:06,256 INFO L226 Difference]: Without dead ends: 689 [2019-10-22 11:24:06,256 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-10-22 11:24:06,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-10-22 11:24:06,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 509. [2019-10-22 11:24:06,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-10-22 11:24:06,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 625 transitions. [2019-10-22 11:24:06,307 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 625 transitions. Word has length 38 [2019-10-22 11:24:06,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:06,307 INFO L462 AbstractCegarLoop]: Abstraction has 509 states and 625 transitions. [2019-10-22 11:24:06,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:06,307 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 625 transitions. [2019-10-22 11:24:06,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-22 11:24:06,308 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:06,308 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-10-22 11:24:06,308 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:06,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:06,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1329794158, now seen corresponding path program 1 times [2019-10-22 11:24:06,308 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:06,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939684645] [2019-10-22 11:24:06,309 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:06,309 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:06,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:06,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:06,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939684645] [2019-10-22 11:24:06,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:06,360 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:06,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356374913] [2019-10-22 11:24:06,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:06,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:06,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:06,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:06,361 INFO L87 Difference]: Start difference. First operand 509 states and 625 transitions. Second operand 5 states. [2019-10-22 11:24:06,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:06,576 INFO L93 Difference]: Finished difference Result 855 states and 1033 transitions. [2019-10-22 11:24:06,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:24:06,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-22 11:24:06,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:06,579 INFO L225 Difference]: With dead ends: 855 [2019-10-22 11:24:06,579 INFO L226 Difference]: Without dead ends: 699 [2019-10-22 11:24:06,580 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-10-22 11:24:06,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-10-22 11:24:06,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 509. [2019-10-22 11:24:06,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-10-22 11:24:06,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 621 transitions. [2019-10-22 11:24:06,634 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 621 transitions. Word has length 38 [2019-10-22 11:24:06,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:06,634 INFO L462 AbstractCegarLoop]: Abstraction has 509 states and 621 transitions. [2019-10-22 11:24:06,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:06,635 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 621 transitions. [2019-10-22 11:24:06,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-22 11:24:06,635 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:06,635 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-10-22 11:24:06,636 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:06,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:06,636 INFO L82 PathProgramCache]: Analyzing trace with hash 595887759, now seen corresponding path program 1 times [2019-10-22 11:24:06,636 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:06,636 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482786934] [2019-10-22 11:24:06,636 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:06,636 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:06,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:06,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482786934] [2019-10-22 11:24:06,690 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:06,690 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:06,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136273749] [2019-10-22 11:24:06,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:06,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:06,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:06,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:06,691 INFO L87 Difference]: Start difference. First operand 509 states and 621 transitions. Second operand 5 states. [2019-10-22 11:24:06,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:06,953 INFO L93 Difference]: Finished difference Result 977 states and 1195 transitions. [2019-10-22 11:24:06,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:24:06,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-22 11:24:06,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:06,956 INFO L225 Difference]: With dead ends: 977 [2019-10-22 11:24:06,956 INFO L226 Difference]: Without dead ends: 847 [2019-10-22 11:24:06,957 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-10-22 11:24:06,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-10-22 11:24:07,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 509. [2019-10-22 11:24:07,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-10-22 11:24:07,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 620 transitions. [2019-10-22 11:24:07,012 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 620 transitions. Word has length 41 [2019-10-22 11:24:07,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:07,013 INFO L462 AbstractCegarLoop]: Abstraction has 509 states and 620 transitions. [2019-10-22 11:24:07,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:07,013 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 620 transitions. [2019-10-22 11:24:07,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-22 11:24:07,014 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:07,014 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-10-22 11:24:07,014 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:07,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:07,014 INFO L82 PathProgramCache]: Analyzing trace with hash 768333102, now seen corresponding path program 1 times [2019-10-22 11:24:07,014 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:07,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804028979] [2019-10-22 11:24:07,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:07,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:07,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:07,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:07,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804028979] [2019-10-22 11:24:07,065 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:07,065 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:24:07,065 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880057371] [2019-10-22 11:24:07,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:24:07,066 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:07,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:24:07,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:07,066 INFO L87 Difference]: Start difference. First operand 509 states and 620 transitions. Second operand 7 states. [2019-10-22 11:24:07,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:07,299 INFO L93 Difference]: Finished difference Result 527 states and 637 transitions. [2019-10-22 11:24:07,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:24:07,299 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-10-22 11:24:07,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:07,300 INFO L225 Difference]: With dead ends: 527 [2019-10-22 11:24:07,301 INFO L226 Difference]: Without dead ends: 385 [2019-10-22 11:24:07,301 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-10-22 11:24:07,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-10-22 11:24:07,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 367. [2019-10-22 11:24:07,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-22 11:24:07,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 446 transitions. [2019-10-22 11:24:07,343 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 446 transitions. Word has length 41 [2019-10-22 11:24:07,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:07,343 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 446 transitions. [2019-10-22 11:24:07,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:24:07,343 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 446 transitions. [2019-10-22 11:24:07,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 11:24:07,344 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:07,344 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:07,345 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:07,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:07,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1022149612, now seen corresponding path program 1 times [2019-10-22 11:24:07,345 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:07,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413962891] [2019-10-22 11:24:07,345 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:07,345 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:07,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:07,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413962891] [2019-10-22 11:24:07,372 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:07,372 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:07,372 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25748025] [2019-10-22 11:24:07,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:07,373 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:07,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:07,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:07,373 INFO L87 Difference]: Start difference. First operand 367 states and 446 transitions. Second operand 3 states. [2019-10-22 11:24:07,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:07,466 INFO L93 Difference]: Finished difference Result 500 states and 615 transitions. [2019-10-22 11:24:07,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:07,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-22 11:24:07,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:07,468 INFO L225 Difference]: With dead ends: 500 [2019-10-22 11:24:07,468 INFO L226 Difference]: Without dead ends: 329 [2019-10-22 11:24:07,468 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-10-22 11:24:07,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-10-22 11:24:07,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2019-10-22 11:24:07,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-10-22 11:24:07,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 397 transitions. [2019-10-22 11:24:07,545 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 397 transitions. Word has length 45 [2019-10-22 11:24:07,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:07,545 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 397 transitions. [2019-10-22 11:24:07,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:07,545 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 397 transitions. [2019-10-22 11:24:07,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 11:24:07,546 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:07,546 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-10-22 11:24:07,546 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:07,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:07,547 INFO L82 PathProgramCache]: Analyzing trace with hash 632304062, now seen corresponding path program 1 times [2019-10-22 11:24:07,547 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:07,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466248135] [2019-10-22 11:24:07,547 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:07,547 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:07,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:07,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:07,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466248135] [2019-10-22 11:24:07,593 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:07,594 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:24:07,594 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235344392] [2019-10-22 11:24:07,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:24:07,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:07,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:24:07,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:07,595 INFO L87 Difference]: Start difference. First operand 329 states and 397 transitions. Second operand 7 states. [2019-10-22 11:24:07,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:07,810 INFO L93 Difference]: Finished difference Result 459 states and 546 transitions. [2019-10-22 11:24:07,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:24:07,810 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-10-22 11:24:07,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:07,812 INFO L225 Difference]: With dead ends: 459 [2019-10-22 11:24:07,812 INFO L226 Difference]: Without dead ends: 441 [2019-10-22 11:24:07,812 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 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-10-22 11:24:07,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-10-22 11:24:07,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 335. [2019-10-22 11:24:07,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-10-22 11:24:07,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 403 transitions. [2019-10-22 11:24:07,850 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 403 transitions. Word has length 51 [2019-10-22 11:24:07,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:07,850 INFO L462 AbstractCegarLoop]: Abstraction has 335 states and 403 transitions. [2019-10-22 11:24:07,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:24:07,850 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 403 transitions. [2019-10-22 11:24:07,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-22 11:24:07,851 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:07,851 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:07,851 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:07,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:07,852 INFO L82 PathProgramCache]: Analyzing trace with hash -605199811, now seen corresponding path program 1 times [2019-10-22 11:24:07,852 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:07,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036677764] [2019-10-22 11:24:07,852 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:07,852 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:07,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:07,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:07,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036677764] [2019-10-22 11:24:07,902 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:07,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:24:07,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644647887] [2019-10-22 11:24:07,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:24:07,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:07,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:24:07,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:07,903 INFO L87 Difference]: Start difference. First operand 335 states and 403 transitions. Second operand 7 states. [2019-10-22 11:24:08,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:08,099 INFO L93 Difference]: Finished difference Result 464 states and 551 transitions. [2019-10-22 11:24:08,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:24:08,100 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-10-22 11:24:08,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:08,101 INFO L225 Difference]: With dead ends: 464 [2019-10-22 11:24:08,102 INFO L226 Difference]: Without dead ends: 446 [2019-10-22 11:24:08,102 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-10-22 11:24:08,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-10-22 11:24:08,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 329. [2019-10-22 11:24:08,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-10-22 11:24:08,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 396 transitions. [2019-10-22 11:24:08,139 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 396 transitions. Word has length 52 [2019-10-22 11:24:08,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:08,139 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 396 transitions. [2019-10-22 11:24:08,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:24:08,139 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 396 transitions. [2019-10-22 11:24:08,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-22 11:24:08,140 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:08,140 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-10-22 11:24:08,140 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:08,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:08,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1054423066, now seen corresponding path program 1 times [2019-10-22 11:24:08,141 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:08,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831292008] [2019-10-22 11:24:08,141 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:08,141 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:08,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:08,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:08,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831292008] [2019-10-22 11:24:08,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:08,161 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:08,161 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265467713] [2019-10-22 11:24:08,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:08,162 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:08,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:08,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:08,162 INFO L87 Difference]: Start difference. First operand 329 states and 396 transitions. Second operand 3 states. [2019-10-22 11:24:08,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:08,219 INFO L93 Difference]: Finished difference Result 575 states and 698 transitions. [2019-10-22 11:24:08,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:08,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-22 11:24:08,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:08,220 INFO L225 Difference]: With dead ends: 575 [2019-10-22 11:24:08,220 INFO L226 Difference]: Without dead ends: 383 [2019-10-22 11:24:08,221 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-10-22 11:24:08,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-10-22 11:24:08,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 329. [2019-10-22 11:24:08,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-10-22 11:24:08,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 392 transitions. [2019-10-22 11:24:08,256 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 392 transitions. Word has length 54 [2019-10-22 11:24:08,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:08,256 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 392 transitions. [2019-10-22 11:24:08,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 392 transitions. [2019-10-22 11:24:08,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-22 11:24:08,257 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:08,257 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-10-22 11:24:08,257 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:08,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:08,258 INFO L82 PathProgramCache]: Analyzing trace with hash 273758220, now seen corresponding path program 1 times [2019-10-22 11:24:08,258 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:08,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429658187] [2019-10-22 11:24:08,258 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:08,258 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:08,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:24:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:24:08,314 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:24:08,314 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:24:08,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:24:08 BoogieIcfgContainer [2019-10-22 11:24:08,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:24:08,430 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:24:08,430 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:24:08,430 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:24:08,431 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:56" (3/4) ... [2019-10-22 11:24:08,433 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:24:08,543 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6c315d77-b1cd-4619-9dd1-51962c60f8b1/bin/utaipan/witness.graphml [2019-10-22 11:24:08,546 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:24:08,548 INFO L168 Benchmark]: Toolchain (without parser) took 13919.92 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 613.4 MB). Free memory was 940.5 MB in the beginning and 1.3 GB in the end (delta: -320.3 MB). Peak memory consumption was 293.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:08,550 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:08,550 INFO L168 Benchmark]: CACSL2BoogieTranslator took 564.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.6 MB). Free memory was 940.5 MB in the beginning and 1.2 GB in the end (delta: -216.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:08,550 INFO L168 Benchmark]: Boogie Procedure Inliner took 134.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:08,551 INFO L168 Benchmark]: Boogie Preprocessor took 104.12 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:08,551 INFO L168 Benchmark]: RCFGBuilder took 1203.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.3 MB in the end (delta: 143.6 MB). Peak memory consumption was 143.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:08,551 INFO L168 Benchmark]: TraceAbstraction took 11791.75 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 437.8 MB). Free memory was 999.3 MB in the beginning and 1.3 GB in the end (delta: -282.0 MB). Peak memory consumption was 155.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:08,551 INFO L168 Benchmark]: Witness Printer took 115.71 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:08,554 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 564.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.6 MB). Free memory was 940.5 MB in the beginning and 1.2 GB in the end (delta: -216.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 134.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 104.12 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1203.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.3 MB in the end (delta: 143.6 MB). Peak memory consumption was 143.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11791.75 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 437.8 MB). Free memory was 999.3 MB in the beginning and 1.3 GB in the end (delta: -282.0 MB). Peak memory consumption was 155.8 MB. Max. memory is 11.5 GB. * Witness Printer took 115.71 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 64]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L35] int FloppyThread ; [L36] int KernelMode ; [L37] int Suspended ; [L38] int Executive ; [L39] int DiskController ; [L40] int FloppyDiskPeripheral ; [L41] int FlConfigCallBack ; [L42] int MaximumInterfaceType ; [L43] int MOUNTDEV_MOUNTED_DEVICE_GUID ; [L44] int myStatus ; [L45] int s ; [L46] int UNLOADED ; [L47] int NP ; [L48] int DC ; [L49] int SKIP1 ; [L50] int SKIP2 ; [L51] int MPR1 ; [L52] int MPR3 ; [L53] int IPC ; [L54] int pended ; [L55] int compRegistered ; [L56] int lowerDriverReturn ; [L57] int setEventCalled ; [L58] int customIrp ; [L90] int PagingReferenceCount = 0; [L91] 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] [L670] int status ; [L671] int irp = __VERIFIER_nondet_int() ; [L672] int pirp ; [L673] int pirp__IoStatus__Status ; [L674] int irp_choice = __VERIFIER_nondet_int() ; [L675] int devobj = __VERIFIER_nondet_int() ; [L676] int __cil_tmp8 ; [L678] FloppyThread = 0 [L679] KernelMode = 0 [L680] Suspended = 0 [L681] Executive = 0 [L682] DiskController = 0 [L683] FloppyDiskPeripheral = 0 [L684] FlConfigCallBack = 0 [L685] MaximumInterfaceType = 0 [L686] MOUNTDEV_MOUNTED_DEVICE_GUID = 0 [L687] myStatus = 0 [L688] s = 0 [L689] UNLOADED = 0 [L690] NP = 0 [L691] DC = 0 [L692] SKIP1 = 0 [L693] SKIP2 = 0 [L694] MPR1 = 0 [L695] MPR3 = 0 [L696] IPC = 0 [L697] pended = 0 [L698] compRegistered = 0 [L699] lowerDriverReturn = 0 [L700] setEventCalled = 0 [L701] customIrp = 0 [L705] status = 0 [L706] pirp = irp [L73] UNLOADED = 0 [L74] NP = 1 [L75] DC = 2 [L76] SKIP1 = 3 [L77] SKIP2 = 4 [L78] MPR1 = 5 [L79] MPR3 = 6 [L80] IPC = 7 [L81] s = UNLOADED [L82] pended = 0 [L83] compRegistered = 0 [L84] lowerDriverReturn = 0 [L85] setEventCalled = 0 [L86] 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] [L709] COND TRUE status >= 0 [L710] s = NP [L711] customIrp = 0 [L712] setEventCalled = customIrp [L713] lowerDriverReturn = setEventCalled [L714] compRegistered = lowerDriverReturn [L715] pended = compRegistered [L716] pirp__IoStatus__Status = 0 [L717] 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] [L718] COND TRUE irp_choice == 0 [L719] pirp__IoStatus__Status = -1073741637 [L720] 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] [L660] s = NP [L661] pended = 0 [L662] compRegistered = 0 [L663] lowerDriverReturn = 0 [L664] setEventCalled = 0 [L665] 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] [L726] COND FALSE !(status < 0) [L730] int tmp_ndt_1; [L731] tmp_ndt_1 = __VERIFIER_nondet_int() [L732] COND TRUE tmp_ndt_1 == 3 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L163] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L164] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L165] int Irp__IoStatus__Information ; [L166] int Irp__IoStatus__Status ; [L167] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L168] int disketteExtension__IsRemoved = __VERIFIER_nondet_int() ; [L169] int disketteExtension__IsStarted = __VERIFIER_nondet_int() ; [L170] int disketteExtension__TargetObject = __VERIFIER_nondet_int() ; [L171] int disketteExtension__HoldNewRequests ; [L172] int disketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L173] int disketteExtension__InterfaceString__Buffer = __VERIFIER_nondet_int() ; [L174] int disketteExtension__InterfaceString = __VERIFIER_nondet_int() ; [L175] int disketteExtension__ArcName__Length = __VERIFIER_nondet_int() ; [L176] int disketteExtension__ArcName = __VERIFIER_nondet_int() ; [L177] int irpSp__MinorFunction = __VERIFIER_nondet_int() ; [L178] int IoGetConfigurationInformation__FloppyCount = __VERIFIER_nondet_int() ; [L179] int irpSp ; [L180] int disketteExtension ; [L181] int ntStatus ; [L182] int doneEvent = __VERIFIER_nondet_int() ; [L183] int irpSp___0 ; [L184] int nextIrpSp ; [L185] int nextIrpSp__Control ; [L186] int irpSp___1 ; [L187] int irpSp__Context ; [L188] int irpSp__Control ; [L189] long __cil_tmp29 ; [L190] long __cil_tmp30 ; [L193] ntStatus = 0 [L194] 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] [L195] 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] [L198] disketteExtension = DeviceObject__DeviceExtension [L199] 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] [L200] 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] [L209] 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] [L212] 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] [L238] 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] [L241] COND FALSE !(! disketteExtension__IsStarted) [L257] disketteExtension__HoldNewRequests = 1 [L100] int status ; [L101] int threadHandle = __VERIFIER_nondet_int() ; [L102] int DisketteExtension__PoweringDown = __VERIFIER_nondet_int() ; [L103] int DisketteExtension__ThreadReferenceCount = __VERIFIER_nondet_int() ; [L104] int DisketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L105] int Irp__IoStatus__Status ; [L106] int Irp__IoStatus__Information ; [L107] int Irp__Tail__Overlay__CurrentStackLocation__Control ; [L108] int ObjAttributes = __VERIFIER_nondet_int() ; [L109] int __cil_tmp12 ; [L110] 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] [L113] COND FALSE !(DisketteExtension__PoweringDown == 1) [L119] 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] [L120] 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] [L152] COND TRUE pended == 0 [L153] 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] [L159] 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] [L258] ntStatus = FlQueueIrpToThread(Irp, disketteExtension) [L261] __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] [L262] COND TRUE __cil_tmp29 == 259L [L1035] 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] [L1044] 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] [L1048] 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] [L1055] int tmp_ndt_8; [L1056] tmp_ndt_8 = __VERIFIER_nondet_int() [L1057] COND TRUE tmp_ndt_8 == 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1063] 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] [L267] 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] [L270] disketteExtension__FloppyThread = 0 [L271] Irp__IoStatus__Status = 0 [L272] 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] [L273] COND TRUE s == NP [L274] 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] [L281] Irp__CurrentLocation ++ [L282] Irp__Tail__Overlay__CurrentStackLocation ++ [L937] int returnVal2 ; [L938] int compRetStatus1 ; [L939] int lcontext = __VERIFIER_nondet_int() ; [L940] 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] [L943] 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] [L956] int tmp_ndt_12; [L957] tmp_ndt_12 = __VERIFIER_nondet_int() [L958] COND TRUE tmp_ndt_12 == 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L969] 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] [L982] 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] [L986] 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] [L995] COND TRUE s == SKIP1 [L996] s = SKIP2 [L997] 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] [L1005] 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] [L283] ntStatus = IofCallDriver(disketteExtension__TargetObject, Irp) [L429] 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] [L430] 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] [L433] 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] [L739] status = FloppyPnp(devobj, pirp) [L749] 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] [L750] 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] [L757] 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] [L758] 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] [L765] 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] [L766] 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] [L767] 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] [L781] 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] [L782] 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] [L64] __VERIFIER_error() VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 421 locations, 41 error locations. Result: UNSAFE, OverallTime: 11.7s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 16984 SDtfs, 13228 SDslu, 25141 SDs, 0 SdLazy, 4888 SolverSat, 501 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=670occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 39 MinimizatonAttempts, 3014 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1344 NumberOfCodeBlocks, 1344 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1250 ConstructedInterpolants, 0 QuantifiedInterpolants, 109920 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...