./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ntdrivers/parport_true-unreach-call.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fc04e408-f2a4-4fba-aac8-059b9783d399/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fc04e408-f2a4-4fba-aac8-059b9783d399/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fc04e408-f2a4-4fba-aac8-059b9783d399/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fc04e408-f2a4-4fba-aac8-059b9783d399/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers/parport_true-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fc04e408-f2a4-4fba-aac8-059b9783d399/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fc04e408-f2a4-4fba-aac8-059b9783d399/bin-2019/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 c382c054908dd436240a631a5e6d7113fd867a7b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fc04e408-f2a4-4fba-aac8-059b9783d399/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fc04e408-f2a4-4fba-aac8-059b9783d399/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fc04e408-f2a4-4fba-aac8-059b9783d399/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fc04e408-f2a4-4fba-aac8-059b9783d399/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers/parport_true-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fc04e408-f2a4-4fba-aac8-059b9783d399/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fc04e408-f2a4-4fba-aac8-059b9783d399/bin-2019/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 c382c054908dd436240a631a5e6d7113fd867a7b .................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: TYPE ERROR --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 11:05:22,573 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:05:22,574 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:05:22,588 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:05:22,588 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:05:22,589 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:05:22,590 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:05:22,591 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:05:22,599 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:05:22,600 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:05:22,600 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:05:22,601 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:05:22,601 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:05:22,602 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:05:22,603 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:05:22,605 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:05:22,612 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:05:22,613 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:05:22,615 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:05:22,616 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:05:22,617 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:05:22,617 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:05:22,627 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:05:22,628 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:05:22,628 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:05:22,628 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:05:22,629 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:05:22,630 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:05:22,630 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:05:22,631 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:05:22,631 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:05:22,632 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:05:22,633 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:05:22,633 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:05:22,633 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:05:22,634 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:05:22,634 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fc04e408-f2a4-4fba-aac8-059b9783d399/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 11:05:22,652 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:05:22,652 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:05:22,664 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 11:05:22,664 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 11:05:22,664 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 11:05:22,664 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 11:05:22,665 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 11:05:22,665 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 11:05:22,665 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 11:05:22,665 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 11:05:22,665 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 11:05:22,665 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 11:05:22,665 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 11:05:22,666 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:05:22,666 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:05:22,666 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:05:22,666 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:05:22,666 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:05:22,666 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 11:05:22,666 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 11:05:22,667 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 11:05:22,667 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:05:22,667 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:05:22,667 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:05:22,667 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 11:05:22,669 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:05:22,669 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:05:22,669 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 11:05:22,670 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 11:05:22,670 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 11:05:22,670 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:05:22,670 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 11:05:22,670 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 11:05:22,670 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 11:05:22,670 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 11:05:22,670 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 11:05:22,671 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 11:05:22,671 INFO L133 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_fc04e408-f2a4-4fba-aac8-059b9783d399/bin-2019/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 -> c382c054908dd436240a631a5e6d7113fd867a7b [2018-11-18 11:05:22,717 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:05:22,726 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:05:22,733 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:05:22,734 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:05:22,734 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:05:22,735 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fc04e408-f2a4-4fba-aac8-059b9783d399/bin-2019/utaipan/../../sv-benchmarks/c/ntdrivers/parport_true-unreach-call.i.cil.c [2018-11-18 11:05:22,789 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fc04e408-f2a4-4fba-aac8-059b9783d399/bin-2019/utaipan/data/7a6507edb/07254db26bf7468482dc58c5b0b5bd1a/FLAGcc2135788 [2018-11-18 11:05:23,419 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:05:23,419 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fc04e408-f2a4-4fba-aac8-059b9783d399/sv-benchmarks/c/ntdrivers/parport_true-unreach-call.i.cil.c [2018-11-18 11:05:23,454 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fc04e408-f2a4-4fba-aac8-059b9783d399/bin-2019/utaipan/data/7a6507edb/07254db26bf7468482dc58c5b0b5bd1a/FLAGcc2135788 [2018-11-18 11:05:23,766 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fc04e408-f2a4-4fba-aac8-059b9783d399/bin-2019/utaipan/data/7a6507edb/07254db26bf7468482dc58c5b0b5bd1a [2018-11-18 11:05:23,769 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:05:23,771 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:05:23,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:05:23,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:05:23,782 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:05:23,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:05:23" (1/1) ... [2018-11-18 11:05:23,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aff61ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:23, skipping insertion in model container [2018-11-18 11:05:23,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:05:23" (1/1) ... [2018-11-18 11:05:23,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:05:23,938 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:05:26,018 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:05:26,035 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:05:26,586 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:05:26,821 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:05:26,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:26 WrapperNode [2018-11-18 11:05:26,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:05:26,822 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:05:26,822 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:05:26,822 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:05:26,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:26" (1/1) ... [2018-11-18 11:05:26,906 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:26" (1/1) ... [2018-11-18 11:05:26,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:05:26,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:05:26,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:05:26,942 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:05:26,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:26" (1/1) ... [2018-11-18 11:05:26,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:26" (1/1) ... [2018-11-18 11:05:26,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:26" (1/1) ... [2018-11-18 11:05:26,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:26" (1/1) ... [2018-11-18 11:05:27,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:26" (1/1) ... [2018-11-18 11:05:27,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:26" (1/1) ... [2018-11-18 11:05:27,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:26" (1/1) ... [2018-11-18 11:05:27,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:05:27,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:05:27,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:05:27,238 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:05:27,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc04e408-f2a4-4fba-aac8-059b9783d399/bin-2019/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 [2018-11-18 11:05:27,294 INFO L130 BoogieDeclarations]: Found specification of procedure PptCheckIfStlProductId [2018-11-18 11:05:27,295 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCheckIfStlProductId [2018-11-18 11:05:27,295 INFO L130 BoogieDeclarations]: Found specification of procedure PptDebugDumpResourceRequirementsList [2018-11-18 11:05:27,295 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDebugDumpResourceRequirementsList [2018-11-18 11:05:27,295 INFO L130 BoogieDeclarations]: Found specification of procedure PptAcquireRemoveLock [2018-11-18 11:05:27,295 INFO L138 BoogieDeclarations]: Found implementation of procedure PptAcquireRemoveLock [2018-11-18 11:05:27,295 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectEppPortIfDot3DevicePresent [2018-11-18 11:05:27,295 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectEppPortIfDot3DevicePresent [2018-11-18 11:05:27,296 INFO L130 BoogieDeclarations]: Found specification of procedure WRITE_PORT_UCHAR [2018-11-18 11:05:27,296 INFO L138 BoogieDeclarations]: Found implementation of procedure WRITE_PORT_UCHAR [2018-11-18 11:05:27,296 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipClockDiskModeByte [2018-11-18 11:05:27,296 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipClockDiskModeByte [2018-11-18 11:05:27,296 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~PVOID~0~TO~~BOOLEAN~0 [2018-11-18 11:05:27,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~PVOID~0~TO~~BOOLEAN~0 [2018-11-18 11:05:27,296 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchPower [2018-11-18 11:05:27,296 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchPower [2018-11-18 11:05:27,297 INFO L130 BoogieDeclarations]: Found specification of procedure PptClearByteMode [2018-11-18 11:05:27,297 INFO L138 BoogieDeclarations]: Found implementation of procedure PptClearByteMode [2018-11-18 11:05:27,297 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterNukeIrqResourceDescriptors [2018-11-18 11:05:27,297 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterNukeIrqResourceDescriptors [2018-11-18 11:05:27,297 INFO L130 BoogieDeclarations]: Found specification of procedure PptIsPci [2018-11-18 11:05:27,297 INFO L138 BoogieDeclarations]: Found implementation of procedure PptIsPci [2018-11-18 11:05:27,297 INFO L130 BoogieDeclarations]: Found specification of procedure PptConnectInterrupt [2018-11-18 11:05:27,297 INFO L138 BoogieDeclarations]: Found implementation of procedure PptConnectInterrupt [2018-11-18 11:05:27,297 INFO L130 BoogieDeclarations]: Found specification of procedure KeStallExecutionProcessor [2018-11-18 11:05:27,297 INFO L138 BoogieDeclarations]: Found implementation of procedure KeStallExecutionProcessor [2018-11-18 11:05:27,298 INFO L130 BoogieDeclarations]: Found specification of procedure PptBuildResourceList [2018-11-18 11:05:27,298 INFO L138 BoogieDeclarations]: Found implementation of procedure PptBuildResourceList [2018-11-18 11:05:27,298 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2018-11-18 11:05:27,298 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2018-11-18 11:05:27,298 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchSystemControl [2018-11-18 11:05:27,298 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchSystemControl [2018-11-18 11:05:27,298 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpSurpriseRemoval [2018-11-18 11:05:27,298 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpSurpriseRemoval [2018-11-18 11:05:27,298 INFO L130 BoogieDeclarations]: Found specification of procedure PptEcrSetMode [2018-11-18 11:05:27,298 INFO L138 BoogieDeclarations]: Found implementation of procedure PptEcrSetMode [2018-11-18 11:05:27,299 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectChipFilter [2018-11-18 11:05:27,299 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectChipFilter [2018-11-18 11:05:27,299 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStartDevice [2018-11-18 11:05:27,299 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStartDevice [2018-11-18 11:05:27,299 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseRemoveLockAndWaitEx [2018-11-18 11:05:27,299 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseRemoveLockAndWaitEx [2018-11-18 11:05:27,299 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterGetEndOfResourceRequirementsList [2018-11-18 11:05:27,299 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterGetEndOfResourceRequirementsList [2018-11-18 11:05:27,299 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpQueryRemoveDevice [2018-11-18 11:05:27,299 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpQueryRemoveDevice [2018-11-18 11:05:27,300 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-18 11:05:27,300 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-18 11:05:27,300 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedExchange [2018-11-18 11:05:27,300 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedExchange [2018-11-18 11:05:27,300 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchClose [2018-11-18 11:05:27,300 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchClose [2018-11-18 11:05:27,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-11-18 11:05:27,300 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-11-18 11:05:27,300 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedDecrement [2018-11-18 11:05:27,300 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedDecrement [2018-11-18 11:05:27,301 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-18 11:05:27,301 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-18 11:05:27,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 11:05:27,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 11:05:27,301 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchPnp [2018-11-18 11:05:27,301 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchPnp [2018-11-18 11:05:27,301 INFO L130 BoogieDeclarations]: Found specification of procedure PptDebugDumpResourceList [2018-11-18 11:05:27,301 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDebugDumpResourceList [2018-11-18 11:05:27,301 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpPassThroughPnpIrpAndReleaseRemoveLock [2018-11-18 11:05:27,301 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpPassThroughPnpIrpAndReleaseRemoveLock [2018-11-18 11:05:27,301 INFO L130 BoogieDeclarations]: Found specification of procedure PptEcrClearMode [2018-11-18 11:05:27,302 INFO L138 BoogieDeclarations]: Found implementation of procedure PptEcrClearMode [2018-11-18 11:05:27,302 INFO L130 BoogieDeclarations]: Found specification of procedure WmiSystemControl [2018-11-18 11:05:27,302 INFO L138 BoogieDeclarations]: Found implementation of procedure WmiSystemControl [2018-11-18 11:05:27,302 INFO L130 BoogieDeclarations]: Found specification of procedure PptDumpRemovalRelationsList [2018-11-18 11:05:27,302 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDumpRemovalRelationsList [2018-11-18 11:05:27,302 INFO L130 BoogieDeclarations]: Found specification of procedure PptLogError [2018-11-18 11:05:27,302 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLogError [2018-11-18 11:05:27,302 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchCreate [2018-11-18 11:05:27,302 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchCreate [2018-11-18 11:05:27,302 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateErrorLogEntry [2018-11-18 11:05:27,303 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateErrorLogEntry [2018-11-18 11:05:27,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 11:05:27,303 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchInternalDeviceControl [2018-11-18 11:05:27,303 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchInternalDeviceControl [2018-11-18 11:05:27,303 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-18 11:05:27,303 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-18 11:05:27,303 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStartValidateResources [2018-11-18 11:05:27,306 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStartValidateResources [2018-11-18 11:05:27,306 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpUnhandledIrp [2018-11-18 11:05:27,306 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpUnhandledIrp [2018-11-18 11:05:27,306 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterExistsNonIrqResourceList [2018-11-18 11:05:27,306 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterExistsNonIrqResourceList [2018-11-18 11:05:27,307 INFO L130 BoogieDeclarations]: Found specification of procedure PptIsNecR98Machine [2018-11-18 11:05:27,307 INFO L138 BoogieDeclarations]: Found implementation of procedure PptIsNecR98Machine [2018-11-18 11:05:27,307 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStartScanPciCardCmResourceList [2018-11-18 11:05:27,307 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStartScanPciCardCmResourceList [2018-11-18 11:05:27,307 INFO L130 BoogieDeclarations]: Found specification of procedure CheckPort [2018-11-18 11:05:27,307 INFO L138 BoogieDeclarations]: Found implementation of procedure CheckPort [2018-11-18 11:05:27,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 11:05:27,307 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectPortType [2018-11-18 11:05:27,307 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectPortType [2018-11-18 11:05:27,307 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipSetDiskMode [2018-11-18 11:05:27,308 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipSetDiskMode [2018-11-18 11:05:27,308 INFO L130 BoogieDeclarations]: Found specification of procedure PptTrySelectLegacyZip [2018-11-18 11:05:27,308 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTrySelectLegacyZip [2018-11-18 11:05:27,308 INFO L130 BoogieDeclarations]: Found specification of procedure PptDeselectDevice [2018-11-18 11:05:27,308 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDeselectDevice [2018-11-18 11:05:27,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2018-11-18 11:05:27,308 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2018-11-18 11:05:27,308 INFO L130 BoogieDeclarations]: Found specification of procedure PptDisconnectInterrupt [2018-11-18 11:05:27,308 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDisconnectInterrupt [2018-11-18 11:05:27,308 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2018-11-18 11:05:27,309 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2018-11-18 11:05:27,309 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpBounceAndCatchPnpIrp [2018-11-18 11:05:27,309 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpBounceAndCatchPnpIrp [2018-11-18 11:05:27,309 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterNukeIrqResourceDescriptorsFromAllLists [2018-11-18 11:05:27,309 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterNukeIrqResourceDescriptorsFromAllLists [2018-11-18 11:05:27,309 INFO L130 BoogieDeclarations]: Found specification of procedure KeQueryTickCount [2018-11-18 11:05:27,309 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQueryTickCount [2018-11-18 11:05:27,309 INFO L130 BoogieDeclarations]: Found specification of procedure IoWriteErrorLogEntry [2018-11-18 11:05:27,309 INFO L138 BoogieDeclarations]: Found implementation of procedure IoWriteErrorLogEntry [2018-11-18 11:05:27,309 INFO L130 BoogieDeclarations]: Found specification of procedure PptRemovePptRemovalRelation [2018-11-18 11:05:27,309 INFO L138 BoogieDeclarations]: Found implementation of procedure PptRemovePptRemovalRelation [2018-11-18 11:05:27,309 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectEppPortIfUserRequested [2018-11-18 11:05:27,310 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectEppPortIfUserRequested [2018-11-18 11:05:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2018-11-18 11:05:27,310 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2018-11-18 11:05:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectPortCapabilities [2018-11-18 11:05:27,310 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectPortCapabilities [2018-11-18 11:05:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure KeQueryTimeIncrement [2018-11-18 11:05:27,310 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQueryTimeIncrement [2018-11-18 11:05:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-18 11:05:27,310 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-18 11:05:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedIncrement [2018-11-18 11:05:27,310 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedIncrement [2018-11-18 11:05:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 11:05:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure InitNEC_98 [2018-11-18 11:05:27,311 INFO L138 BoogieDeclarations]: Found implementation of procedure InitNEC_98 [2018-11-18 11:05:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchCompletionRoutine [2018-11-18 11:05:27,311 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchCompletionRoutine [2018-11-18 11:05:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 11:05:27,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 11:05:27,312 INFO L130 BoogieDeclarations]: Found specification of procedure IoReportResourceUsage [2018-11-18 11:05:27,312 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReportResourceUsage [2018-11-18 11:05:27,313 INFO L130 BoogieDeclarations]: Found specification of procedure PptInitiate1284_3 [2018-11-18 11:05:27,313 INFO L138 BoogieDeclarations]: Found implementation of procedure PptInitiate1284_3 [2018-11-18 11:05:27,313 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpQueryStopDevice [2018-11-18 11:05:27,313 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpQueryStopDevice [2018-11-18 11:05:27,313 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseRemoveLockEx [2018-11-18 11:05:27,313 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseRemoveLockEx [2018-11-18 11:05:27,313 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterRemoveIrqResourceLists [2018-11-18 11:05:27,313 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterRemoveIrqResourceLists [2018-11-18 11:05:27,313 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchCleanup [2018-11-18 11:05:27,313 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchCleanup [2018-11-18 11:05:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-18 11:05:27,314 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-18 11:05:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-11-18 11:05:27,314 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-11-18 11:05:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareUnicodeString [2018-11-18 11:05:27,314 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareUnicodeString [2018-11-18 11:05:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipCheckDevice [2018-11-18 11:05:27,314 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipCheckDevice [2018-11-18 11:05:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure READ_PORT_UCHAR [2018-11-18 11:05:27,314 INFO L138 BoogieDeclarations]: Found implementation of procedure READ_PORT_UCHAR [2018-11-18 11:05:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure PptClearChipMode [2018-11-18 11:05:27,315 INFO L138 BoogieDeclarations]: Found implementation of procedure PptClearChipMode [2018-11-18 11:05:27,315 INFO L130 BoogieDeclarations]: Found specification of procedure PptFreePort [2018-11-18 11:05:27,315 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFreePort [2018-11-18 11:05:27,315 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectEcpPort [2018-11-18 11:05:27,315 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectEcpPort [2018-11-18 11:05:27,315 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2018-11-18 11:05:27,315 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2018-11-18 11:05:27,315 INFO L130 BoogieDeclarations]: Found specification of procedure IoWMIRegistrationControl [2018-11-18 11:05:27,315 INFO L138 BoogieDeclarations]: Found implementation of procedure IoWMIRegistrationControl [2018-11-18 11:05:27,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 11:05:27,316 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpCancelStopDevice [2018-11-18 11:05:27,316 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpCancelStopDevice [2018-11-18 11:05:27,316 INFO L130 BoogieDeclarations]: Found specification of procedure PptDeselectLegacyZip [2018-11-18 11:05:27,316 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDeselectLegacyZip [2018-11-18 11:05:27,316 INFO L130 BoogieDeclarations]: Found specification of procedure PptSetCancelRoutine [2018-11-18 11:05:27,316 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSetCancelRoutine [2018-11-18 11:05:27,316 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpListContainsIrqResourceDescriptor [2018-11-18 11:05:27,316 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpListContainsIrqResourceDescriptor [2018-11-18 11:05:27,316 INFO L130 BoogieDeclarations]: Found specification of procedure PptAddPptRemovalRelation [2018-11-18 11:05:27,316 INFO L138 BoogieDeclarations]: Found implementation of procedure PptAddPptRemovalRelation [2018-11-18 11:05:27,316 INFO L130 BoogieDeclarations]: Found specification of procedure PptTrySelectDevice [2018-11-18 11:05:27,317 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTrySelectDevice [2018-11-18 11:05:27,317 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpCancelRemoveDevice [2018-11-18 11:05:27,317 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpCancelRemoveDevice [2018-11-18 11:05:27,317 INFO L130 BoogieDeclarations]: Found specification of procedure PptFindNatChip [2018-11-18 11:05:27,317 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFindNatChip [2018-11-18 11:05:27,317 INFO L130 BoogieDeclarations]: Found specification of procedure PptCheckIfNon1284_3Present [2018-11-18 11:05:27,317 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCheckIfNon1284_3Present [2018-11-18 11:05:27,317 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectBytePort [2018-11-18 11:05:27,317 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectBytePort [2018-11-18 11:05:27,317 INFO L130 BoogieDeclarations]: Found specification of procedure PptReleaseRemoveLock [2018-11-18 11:05:27,317 INFO L138 BoogieDeclarations]: Found implementation of procedure PptReleaseRemoveLock [2018-11-18 11:05:27,318 INFO L130 BoogieDeclarations]: Found specification of procedure PptPowerComplete [2018-11-18 11:05:27,318 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPowerComplete [2018-11-18 11:05:27,318 INFO L130 BoogieDeclarations]: Found specification of procedure PptFailRequest [2018-11-18 11:05:27,318 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFailRequest [2018-11-18 11:05:27,318 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 11:05:27,318 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 11:05:27,318 INFO L130 BoogieDeclarations]: Found specification of procedure IoAcquireRemoveLockEx [2018-11-18 11:05:27,318 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAcquireRemoveLockEx [2018-11-18 11:05:27,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 11:05:27,318 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-18 11:05:27,319 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-18 11:05:27,319 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpBuildRemovalRelations [2018-11-18 11:05:27,319 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpBuildRemovalRelations [2018-11-18 11:05:27,319 INFO L130 BoogieDeclarations]: Found specification of procedure PptSetByteMode [2018-11-18 11:05:27,319 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSetByteMode [2018-11-18 11:05:27,319 INFO L130 BoogieDeclarations]: Found specification of procedure PptCleanRemovalRelationsList [2018-11-18 11:05:27,319 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCleanRemovalRelationsList [2018-11-18 11:05:27,319 INFO L130 BoogieDeclarations]: Found specification of procedure IoConnectInterrupt [2018-11-18 11:05:27,320 INFO L138 BoogieDeclarations]: Found implementation of procedure IoConnectInterrupt [2018-11-18 11:05:27,320 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipClockPrtModeByte [2018-11-18 11:05:27,320 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipClockPrtModeByte [2018-11-18 11:05:27,320 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectEppPort [2018-11-18 11:05:27,320 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectEppPort [2018-11-18 11:05:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-18 11:05:27,321 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-18 11:05:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetermineFifoWidth [2018-11-18 11:05:27,321 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetermineFifoWidth [2018-11-18 11:05:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure PptSend1284_3Command [2018-11-18 11:05:27,321 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSend1284_3Command [2018-11-18 11:05:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure PptSetChipMode [2018-11-18 11:05:27,321 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSetChipMode [2018-11-18 11:05:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStopDevice [2018-11-18 11:05:27,321 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStopDevice [2018-11-18 11:05:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStartScanCmResourceList [2018-11-18 11:05:27,322 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStartScanCmResourceList [2018-11-18 11:05:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetermineFifoDepth [2018-11-18 11:05:27,322 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetermineFifoDepth [2018-11-18 11:05:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure PptCheckByteMode [2018-11-18 11:05:27,322 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCheckByteMode [2018-11-18 11:05:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure PptCompleteRequest [2018-11-18 11:05:27,322 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCompleteRequest [2018-11-18 11:05:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterResourceRequirements [2018-11-18 11:05:27,322 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterResourceRequirements [2018-11-18 11:05:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-18 11:05:27,322 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-18 11:05:27,323 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2018-11-18 11:05:27,323 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2018-11-18 11:05:27,323 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-18 11:05:27,323 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-18 11:05:27,323 INFO L130 BoogieDeclarations]: Found specification of procedure PoRequestPowerIrp [2018-11-18 11:05:27,323 INFO L138 BoogieDeclarations]: Found implementation of procedure PoRequestPowerIrp [2018-11-18 11:05:27,323 INFO L130 BoogieDeclarations]: Found specification of procedure KeSynchronizeExecution [2018-11-18 11:05:27,331 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSynchronizeExecution [2018-11-18 11:05:27,331 INFO L130 BoogieDeclarations]: Found specification of procedure PptAcquireRemoveLockOrFailIrp [2018-11-18 11:05:27,332 INFO L138 BoogieDeclarations]: Found implementation of procedure PptAcquireRemoveLockOrFailIrp [2018-11-18 11:05:27,332 INFO L130 BoogieDeclarations]: Found specification of procedure PptDebugDumpPnpIrpInfo [2018-11-18 11:05:27,332 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDebugDumpPnpIrpInfo [2018-11-18 11:05:27,332 INFO L130 BoogieDeclarations]: Found specification of procedure PptWmiInitWmi [2018-11-18 11:05:27,332 INFO L138 BoogieDeclarations]: Found implementation of procedure PptWmiInitWmi [2018-11-18 11:05:27,332 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PVOID~0~X~~UCHAR~0~TO~~NTSTATUS~0 [2018-11-18 11:05:27,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PVOID~0~X~~UCHAR~0~TO~~NTSTATUS~0 [2018-11-18 11:05:27,332 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpRemoveDevice [2018-11-18 11:05:27,332 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpRemoveDevice [2018-11-18 11:05:27,332 INFO L130 BoogieDeclarations]: Found specification of procedure PoSetPowerState [2018-11-18 11:05:27,332 INFO L138 BoogieDeclarations]: Found implementation of procedure PoSetPowerState [2018-11-18 11:05:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure Ppt1284_3AssignAddress [2018-11-18 11:05:27,333 INFO L138 BoogieDeclarations]: Found implementation of procedure Ppt1284_3AssignAddress [2018-11-18 11:05:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure PptReleaseRemoveLockAndWait [2018-11-18 11:05:27,333 INFO L138 BoogieDeclarations]: Found implementation of procedure PptReleaseRemoveLockAndWait [2018-11-18 11:05:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_guard [2018-11-18 11:05:27,333 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_guard [2018-11-18 11:05:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure PptUnload [2018-11-18 11:05:27,333 INFO L138 BoogieDeclarations]: Found implementation of procedure PptUnload [2018-11-18 11:05:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2018-11-18 11:05:27,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2018-11-18 11:05:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure PptCheckIfStl1284_3 [2018-11-18 11:05:27,334 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCheckIfStl1284_3 [2018-11-18 11:05:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:05:27,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:05:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpQueryDeviceRelations [2018-11-18 11:05:27,334 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpQueryDeviceRelations [2018-11-18 11:05:28,892 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:05:28,892 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:05:29,538 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:05:29,538 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:05:30,488 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:05:30,488 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:05:30,788 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:05:30,788 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:05:31,032 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:05:31,032 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:05:33,789 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:05:33,789 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:05:34,041 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:05:34,041 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:05:34,081 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:05:34,081 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:05:34,088 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:05:34,088 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:05:34,826 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:05:34,826 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:05:35,308 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:05:35,308 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:05:35,893 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:05:35,893 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:05:36,035 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:05:36,035 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:05:36,966 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:05:36,966 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:05:36,967 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:05:36,967 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:05:37,914 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:05:37,914 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:05:38,470 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:05:38,470 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:05:38,496 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:05:38,496 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:05:38,563 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:05:38,563 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:05:38,959 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:05:38,960 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:05:39,422 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:05:39,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:05:39 BoogieIcfgContainer [2018-11-18 11:05:39,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:05:39,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 11:05:39,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 11:05:39,426 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 11:05:39,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:05:23" (1/3) ... [2018-11-18 11:05:39,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44079417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:05:39, skipping insertion in model container [2018-11-18 11:05:39,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:26" (2/3) ... [2018-11-18 11:05:39,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44079417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:05:39, skipping insertion in model container [2018-11-18 11:05:39,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:05:39" (3/3) ... [2018-11-18 11:05:39,431 INFO L112 eAbstractionObserver]: Analyzing ICFG parport_true-unreach-call.i.cil.c [2018-11-18 11:05:39,437 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 11:05:39,443 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 11:05:39,453 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 11:05:39,488 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 11:05:39,488 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 11:05:39,489 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 11:05:39,489 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:05:39,489 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:05:39,489 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 11:05:39,489 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:05:39,489 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 11:05:39,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states. [2018-11-18 11:05:39,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 11:05:39,532 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:05:39,533 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:05:39,535 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:05:39,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:05:39,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1739392166, now seen corresponding path program 1 times [2018-11-18 11:05:39,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:05:39,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:05:39,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:05:39,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:05:39,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:05:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:40,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:05:40,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:05:40,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:05:40,038 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:05:40,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:05:40,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:05:40,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:05:40,064 INFO L87 Difference]: Start difference. First operand 1945 states. Second operand 3 states. [2018-11-18 11:05:40,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:05:40,579 INFO L93 Difference]: Finished difference Result 3773 states and 5697 transitions. [2018-11-18 11:05:40,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:05:40,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 11:05:40,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:05:40,607 INFO L225 Difference]: With dead ends: 3773 [2018-11-18 11:05:40,607 INFO L226 Difference]: Without dead ends: 1937 [2018-11-18 11:05:40,621 INFO L604 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 [2018-11-18 11:05:40,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2018-11-18 11:05:40,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 1937. [2018-11-18 11:05:40,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1937 states. [2018-11-18 11:05:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1937 states and 2768 transitions. [2018-11-18 11:05:40,808 INFO L78 Accepts]: Start accepts. Automaton has 1937 states and 2768 transitions. Word has length 20 [2018-11-18 11:05:40,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:05:40,809 INFO L480 AbstractCegarLoop]: Abstraction has 1937 states and 2768 transitions. [2018-11-18 11:05:40,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:05:40,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1937 states and 2768 transitions. [2018-11-18 11:05:40,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 11:05:40,810 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:05:40,812 INFO L375 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] [2018-11-18 11:05:40,812 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:05:40,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:05:40,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1769932083, now seen corresponding path program 1 times [2018-11-18 11:05:40,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:05:40,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:05:40,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:05:40,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:05:40,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:05:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:41,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:05:41,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:05:41,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:05:41,070 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:05:41,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:05:41,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:05:41,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:05:41,076 INFO L87 Difference]: Start difference. First operand 1937 states and 2768 transitions. Second operand 3 states. [2018-11-18 11:05:43,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:05:43,177 INFO L93 Difference]: Finished difference Result 4915 states and 7112 transitions. [2018-11-18 11:05:43,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:05:43,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 11:05:43,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:05:43,202 INFO L225 Difference]: With dead ends: 4915 [2018-11-18 11:05:43,202 INFO L226 Difference]: Without dead ends: 3641 [2018-11-18 11:05:43,209 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:05:43,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3641 states. [2018-11-18 11:05:43,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3641 to 3620. [2018-11-18 11:05:43,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3620 states. [2018-11-18 11:05:43,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3620 states to 3620 states and 5232 transitions. [2018-11-18 11:05:43,427 INFO L78 Accepts]: Start accepts. Automaton has 3620 states and 5232 transitions. Word has length 30 [2018-11-18 11:05:43,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:05:43,428 INFO L480 AbstractCegarLoop]: Abstraction has 3620 states and 5232 transitions. [2018-11-18 11:05:43,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:05:43,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3620 states and 5232 transitions. [2018-11-18 11:05:43,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 11:05:43,433 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:05:43,433 INFO L375 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] [2018-11-18 11:05:43,433 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:05:43,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:05:43,433 INFO L82 PathProgramCache]: Analyzing trace with hash 713459486, now seen corresponding path program 1 times [2018-11-18 11:05:43,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:05:43,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:05:43,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:05:43,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:05:43,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:05:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:43,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:05:43,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:05:43,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:05:43,898 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:05:43,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:05:43,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:05:43,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:05:43,898 INFO L87 Difference]: Start difference. First operand 3620 states and 5232 transitions. Second operand 5 states. [2018-11-18 11:05:54,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:05:54,909 INFO L93 Difference]: Finished difference Result 4403 states and 6356 transitions. [2018-11-18 11:05:54,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:05:54,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-18 11:05:54,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:05:54,932 INFO L225 Difference]: With dead ends: 4403 [2018-11-18 11:05:54,932 INFO L226 Difference]: Without dead ends: 4392 [2018-11-18 11:05:54,934 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:05:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4392 states. [2018-11-18 11:05:55,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4392 to 4361. [2018-11-18 11:05:55,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4361 states. [2018-11-18 11:05:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4361 states to 4361 states and 6304 transitions. [2018-11-18 11:05:55,163 INFO L78 Accepts]: Start accepts. Automaton has 4361 states and 6304 transitions. Word has length 45 [2018-11-18 11:05:55,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:05:55,164 INFO L480 AbstractCegarLoop]: Abstraction has 4361 states and 6304 transitions. [2018-11-18 11:05:55,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:05:55,164 INFO L276 IsEmpty]: Start isEmpty. Operand 4361 states and 6304 transitions. [2018-11-18 11:05:55,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 11:05:55,167 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:05:55,167 INFO L375 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] [2018-11-18 11:05:55,167 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:05:55,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:05:55,169 INFO L82 PathProgramCache]: Analyzing trace with hash 203794660, now seen corresponding path program 1 times [2018-11-18 11:05:55,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:05:55,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:05:55,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:05:55,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:05:55,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:05:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:05:55,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:05:55,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:05:55,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:05:55,598 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:05:55,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:05:55,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:05:55,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:05:55,599 INFO L87 Difference]: Start difference. First operand 4361 states and 6304 transitions. Second operand 5 states. [2018-11-18 11:06:03,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:03,196 INFO L93 Difference]: Finished difference Result 4394 states and 6341 transitions. [2018-11-18 11:06:03,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:06:03,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-11-18 11:06:03,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:06:03,215 INFO L225 Difference]: With dead ends: 4394 [2018-11-18 11:06:03,215 INFO L226 Difference]: Without dead ends: 4386 [2018-11-18 11:06:03,218 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:06:03,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4386 states. [2018-11-18 11:06:03,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4386 to 4361. [2018-11-18 11:06:03,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4361 states. [2018-11-18 11:06:03,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4361 states to 4361 states and 6303 transitions. [2018-11-18 11:06:03,415 INFO L78 Accepts]: Start accepts. Automaton has 4361 states and 6303 transitions. Word has length 46 [2018-11-18 11:06:03,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:06:03,416 INFO L480 AbstractCegarLoop]: Abstraction has 4361 states and 6303 transitions. [2018-11-18 11:06:03,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:06:03,416 INFO L276 IsEmpty]: Start isEmpty. Operand 4361 states and 6303 transitions. [2018-11-18 11:06:03,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-18 11:06:03,418 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:06:03,419 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:03,419 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:06:03,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:03,419 INFO L82 PathProgramCache]: Analyzing trace with hash 583768473, now seen corresponding path program 1 times [2018-11-18 11:06:03,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:06:03,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:03,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:03,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:03,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:06:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:03,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:03,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:03,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:06:03,744 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:06:03,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:06:03,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:06:03,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:06:03,745 INFO L87 Difference]: Start difference. First operand 4361 states and 6303 transitions. Second operand 5 states. [2018-11-18 11:06:04,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:04,088 INFO L93 Difference]: Finished difference Result 8116 states and 11707 transitions. [2018-11-18 11:06:04,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:06:04,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2018-11-18 11:06:04,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:06:04,105 INFO L225 Difference]: With dead ends: 8116 [2018-11-18 11:06:04,106 INFO L226 Difference]: Without dead ends: 4368 [2018-11-18 11:06:04,117 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:06:04,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4368 states. [2018-11-18 11:06:04,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4368 to 4365. [2018-11-18 11:06:04,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4365 states. [2018-11-18 11:06:04,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4365 states to 4365 states and 6308 transitions. [2018-11-18 11:06:04,316 INFO L78 Accepts]: Start accepts. Automaton has 4365 states and 6308 transitions. Word has length 64 [2018-11-18 11:06:04,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:06:04,316 INFO L480 AbstractCegarLoop]: Abstraction has 4365 states and 6308 transitions. [2018-11-18 11:06:04,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:06:04,316 INFO L276 IsEmpty]: Start isEmpty. Operand 4365 states and 6308 transitions. [2018-11-18 11:06:04,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-18 11:06:04,321 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:06:04,321 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:04,321 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:06:04,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:04,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1599908454, now seen corresponding path program 1 times [2018-11-18 11:06:04,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:06:04,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:04,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:04,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:04,331 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:06:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:04,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:04,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:04,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:06:04,779 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:06:04,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:06:04,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:06:04,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:06:04,779 INFO L87 Difference]: Start difference. First operand 4365 states and 6308 transitions. Second operand 6 states. [2018-11-18 11:06:05,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:05,247 INFO L93 Difference]: Finished difference Result 7114 states and 10181 transitions. [2018-11-18 11:06:05,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:06:05,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-18 11:06:05,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:06:05,266 INFO L225 Difference]: With dead ends: 7114 [2018-11-18 11:06:05,266 INFO L226 Difference]: Without dead ends: 4208 [2018-11-18 11:06:05,276 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:06:05,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4208 states. [2018-11-18 11:06:05,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4208 to 4202. [2018-11-18 11:06:05,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4202 states. [2018-11-18 11:06:05,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4202 states to 4202 states and 6038 transitions. [2018-11-18 11:06:05,492 INFO L78 Accepts]: Start accepts. Automaton has 4202 states and 6038 transitions. Word has length 64 [2018-11-18 11:06:05,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:06:05,493 INFO L480 AbstractCegarLoop]: Abstraction has 4202 states and 6038 transitions. [2018-11-18 11:06:05,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:06:05,493 INFO L276 IsEmpty]: Start isEmpty. Operand 4202 states and 6038 transitions. [2018-11-18 11:06:05,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 11:06:05,495 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:06:05,495 INFO L375 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] [2018-11-18 11:06:05,495 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:06:05,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:05,497 INFO L82 PathProgramCache]: Analyzing trace with hash 210928624, now seen corresponding path program 1 times [2018-11-18 11:06:05,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:06:05,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:05,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:05,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:05,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:06:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:05,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:05,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:05,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:06:05,777 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:06:05,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:06:05,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:06:05,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:06:05,778 INFO L87 Difference]: Start difference. First operand 4202 states and 6038 transitions. Second operand 3 states. [2018-11-18 11:06:06,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:06,045 INFO L93 Difference]: Finished difference Result 7068 states and 10098 transitions. [2018-11-18 11:06:06,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:06:06,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-18 11:06:06,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:06:06,067 INFO L225 Difference]: With dead ends: 7068 [2018-11-18 11:06:06,067 INFO L226 Difference]: Without dead ends: 6684 [2018-11-18 11:06:06,072 INFO L604 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 [2018-11-18 11:06:06,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6684 states. [2018-11-18 11:06:06,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6684 to 6620. [2018-11-18 11:06:06,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6620 states. [2018-11-18 11:06:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6620 states to 6620 states and 9541 transitions. [2018-11-18 11:06:06,360 INFO L78 Accepts]: Start accepts. Automaton has 6620 states and 9541 transitions. Word has length 47 [2018-11-18 11:06:06,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:06:06,360 INFO L480 AbstractCegarLoop]: Abstraction has 6620 states and 9541 transitions. [2018-11-18 11:06:06,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:06:06,361 INFO L276 IsEmpty]: Start isEmpty. Operand 6620 states and 9541 transitions. [2018-11-18 11:06:06,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 11:06:06,362 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:06:06,362 INFO L375 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] [2018-11-18 11:06:06,362 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:06:06,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:06,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1753058581, now seen corresponding path program 1 times [2018-11-18 11:06:06,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:06:06,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:06,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:06,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:06,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:06:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:06,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:06,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:06,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:06:06,505 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:06:06,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:06:06,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:06:06,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:06:06,506 INFO L87 Difference]: Start difference. First operand 6620 states and 9541 transitions. Second operand 3 states. [2018-11-18 11:06:06,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:06,745 INFO L93 Difference]: Finished difference Result 6749 states and 9694 transitions. [2018-11-18 11:06:06,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:06:06,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-18 11:06:06,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:06:06,767 INFO L225 Difference]: With dead ends: 6749 [2018-11-18 11:06:06,767 INFO L226 Difference]: Without dead ends: 6720 [2018-11-18 11:06:06,772 INFO L604 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 [2018-11-18 11:06:06,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6720 states. [2018-11-18 11:06:07,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6720 to 6649. [2018-11-18 11:06:07,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-11-18 11:06:07,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 9572 transitions. [2018-11-18 11:06:07,085 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 9572 transitions. Word has length 47 [2018-11-18 11:06:07,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:06:07,085 INFO L480 AbstractCegarLoop]: Abstraction has 6649 states and 9572 transitions. [2018-11-18 11:06:07,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:06:07,085 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 9572 transitions. [2018-11-18 11:06:07,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 11:06:07,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:06:07,087 INFO L375 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] [2018-11-18 11:06:07,087 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:06:07,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:07,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1155394824, now seen corresponding path program 1 times [2018-11-18 11:06:07,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:06:07,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:07,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:07,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:07,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:06:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:07,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:07,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:07,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:06:07,269 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:06:07,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:06:07,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:06:07,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:06:07,270 INFO L87 Difference]: Start difference. First operand 6649 states and 9572 transitions. Second operand 3 states. [2018-11-18 11:06:07,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:07,813 INFO L93 Difference]: Finished difference Result 6652 states and 9574 transitions. [2018-11-18 11:06:07,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:06:07,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-18 11:06:07,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:06:07,834 INFO L225 Difference]: With dead ends: 6652 [2018-11-18 11:06:07,834 INFO L226 Difference]: Without dead ends: 6649 [2018-11-18 11:06:07,837 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:06:07,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6649 states. [2018-11-18 11:06:08,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6649 to 6649. [2018-11-18 11:06:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-11-18 11:06:08,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 9571 transitions. [2018-11-18 11:06:08,245 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 9571 transitions. Word has length 47 [2018-11-18 11:06:08,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:06:08,245 INFO L480 AbstractCegarLoop]: Abstraction has 6649 states and 9571 transitions. [2018-11-18 11:06:08,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:06:08,245 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 9571 transitions. [2018-11-18 11:06:08,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 11:06:08,247 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:06:08,247 INFO L375 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] [2018-11-18 11:06:08,248 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:06:08,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:08,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1973984554, now seen corresponding path program 1 times [2018-11-18 11:06:08,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:06:08,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:08,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:08,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:08,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:06:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:08,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:08,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:08,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 11:06:08,506 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:06:08,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 11:06:08,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 11:06:08,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:06:08,506 INFO L87 Difference]: Start difference. First operand 6649 states and 9571 transitions. Second operand 8 states. [2018-11-18 11:06:08,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:08,675 INFO L93 Difference]: Finished difference Result 6708 states and 9644 transitions. [2018-11-18 11:06:08,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 11:06:08,675 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2018-11-18 11:06:08,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:06:08,690 INFO L225 Difference]: With dead ends: 6708 [2018-11-18 11:06:08,690 INFO L226 Difference]: Without dead ends: 6662 [2018-11-18 11:06:08,693 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-18 11:06:08,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6662 states. [2018-11-18 11:06:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6662 to 6654. [2018-11-18 11:06:08,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6654 states. [2018-11-18 11:06:08,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6654 states to 6654 states and 9578 transitions. [2018-11-18 11:06:08,945 INFO L78 Accepts]: Start accepts. Automaton has 6654 states and 9578 transitions. Word has length 48 [2018-11-18 11:06:08,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:06:08,946 INFO L480 AbstractCegarLoop]: Abstraction has 6654 states and 9578 transitions. [2018-11-18 11:06:08,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 11:06:08,946 INFO L276 IsEmpty]: Start isEmpty. Operand 6654 states and 9578 transitions. [2018-11-18 11:06:08,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 11:06:08,948 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:06:08,948 INFO L375 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] [2018-11-18 11:06:08,948 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:06:08,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:08,948 INFO L82 PathProgramCache]: Analyzing trace with hash -729220073, now seen corresponding path program 1 times [2018-11-18 11:06:08,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:06:08,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:08,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:08,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:08,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:06:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:09,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:09,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:09,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:06:09,171 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:06:09,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:06:09,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:06:09,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:06:09,171 INFO L87 Difference]: Start difference. First operand 6654 states and 9578 transitions. Second operand 6 states. [2018-11-18 11:06:09,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:09,308 INFO L93 Difference]: Finished difference Result 6699 states and 9631 transitions. [2018-11-18 11:06:09,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:06:09,308 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-11-18 11:06:09,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:06:09,325 INFO L225 Difference]: With dead ends: 6699 [2018-11-18 11:06:09,325 INFO L226 Difference]: Without dead ends: 6653 [2018-11-18 11:06:09,330 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:06:09,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6653 states. [2018-11-18 11:06:09,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6653 to 6646. [2018-11-18 11:06:09,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6646 states. [2018-11-18 11:06:09,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6646 states to 6646 states and 9567 transitions. [2018-11-18 11:06:09,570 INFO L78 Accepts]: Start accepts. Automaton has 6646 states and 9567 transitions. Word has length 48 [2018-11-18 11:06:09,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:06:09,570 INFO L480 AbstractCegarLoop]: Abstraction has 6646 states and 9567 transitions. [2018-11-18 11:06:09,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:06:09,570 INFO L276 IsEmpty]: Start isEmpty. Operand 6646 states and 9567 transitions. [2018-11-18 11:06:09,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 11:06:09,571 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:06:09,572 INFO L375 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] [2018-11-18 11:06:09,572 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:06:09,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:09,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1483789076, now seen corresponding path program 1 times [2018-11-18 11:06:09,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:06:09,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:09,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:09,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:09,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:06:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:09,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:09,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:09,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:06:09,833 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:06:09,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:06:09,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:06:09,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:06:09,833 INFO L87 Difference]: Start difference. First operand 6646 states and 9567 transitions. Second operand 5 states. [2018-11-18 11:06:09,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:09,961 INFO L93 Difference]: Finished difference Result 6661 states and 9583 transitions. [2018-11-18 11:06:09,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:06:09,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-18 11:06:09,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:06:09,980 INFO L225 Difference]: With dead ends: 6661 [2018-11-18 11:06:09,980 INFO L226 Difference]: Without dead ends: 6620 [2018-11-18 11:06:09,985 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:06:09,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6620 states. [2018-11-18 11:06:10,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6620 to 6620. [2018-11-18 11:06:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6620 states. [2018-11-18 11:06:10,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6620 states to 6620 states and 9530 transitions. [2018-11-18 11:06:10,212 INFO L78 Accepts]: Start accepts. Automaton has 6620 states and 9530 transitions. Word has length 48 [2018-11-18 11:06:10,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:06:10,212 INFO L480 AbstractCegarLoop]: Abstraction has 6620 states and 9530 transitions. [2018-11-18 11:06:10,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:06:10,212 INFO L276 IsEmpty]: Start isEmpty. Operand 6620 states and 9530 transitions. [2018-11-18 11:06:10,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 11:06:10,214 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:06:10,214 INFO L375 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] [2018-11-18 11:06:10,214 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:06:10,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:10,214 INFO L82 PathProgramCache]: Analyzing trace with hash -885892267, now seen corresponding path program 1 times [2018-11-18 11:06:10,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:06:10,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:10,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:10,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:10,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:06:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:10,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:10,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:10,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:06:10,563 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:06:10,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:06:10,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:06:10,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:06:10,563 INFO L87 Difference]: Start difference. First operand 6620 states and 9530 transitions. Second operand 5 states. [2018-11-18 11:06:10,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:10,696 INFO L93 Difference]: Finished difference Result 6635 states and 9546 transitions. [2018-11-18 11:06:10,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:06:10,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-18 11:06:10,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:06:10,714 INFO L225 Difference]: With dead ends: 6635 [2018-11-18 11:06:10,714 INFO L226 Difference]: Without dead ends: 6618 [2018-11-18 11:06:10,718 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:06:10,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6618 states. [2018-11-18 11:06:11,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6618 to 6618. [2018-11-18 11:06:11,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6618 states. [2018-11-18 11:06:11,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6618 states to 6618 states and 9526 transitions. [2018-11-18 11:06:11,049 INFO L78 Accepts]: Start accepts. Automaton has 6618 states and 9526 transitions. Word has length 52 [2018-11-18 11:06:11,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:06:11,050 INFO L480 AbstractCegarLoop]: Abstraction has 6618 states and 9526 transitions. [2018-11-18 11:06:11,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:06:11,050 INFO L276 IsEmpty]: Start isEmpty. Operand 6618 states and 9526 transitions. [2018-11-18 11:06:11,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 11:06:11,051 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:06:11,052 INFO L375 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] [2018-11-18 11:06:11,052 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:06:11,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:11,052 INFO L82 PathProgramCache]: Analyzing trace with hash 958192982, now seen corresponding path program 1 times [2018-11-18 11:06:11,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:06:11,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:11,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:11,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:11,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:06:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:11,365 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-11-18 11:06:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:11,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:11,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 11:06:11,409 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:06:11,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 11:06:11,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 11:06:11,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:06:11,410 INFO L87 Difference]: Start difference. First operand 6618 states and 9526 transitions. Second operand 8 states. [2018-11-18 11:06:11,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:11,675 INFO L93 Difference]: Finished difference Result 6636 states and 9545 transitions. [2018-11-18 11:06:11,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 11:06:11,675 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-11-18 11:06:11,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:06:11,689 INFO L225 Difference]: With dead ends: 6636 [2018-11-18 11:06:11,689 INFO L226 Difference]: Without dead ends: 6616 [2018-11-18 11:06:11,694 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:06:11,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6616 states. [2018-11-18 11:06:11,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6616 to 6616. [2018-11-18 11:06:11,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6616 states. [2018-11-18 11:06:11,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6616 states to 6616 states and 9521 transitions. [2018-11-18 11:06:11,912 INFO L78 Accepts]: Start accepts. Automaton has 6616 states and 9521 transitions. Word has length 52 [2018-11-18 11:06:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:06:11,913 INFO L480 AbstractCegarLoop]: Abstraction has 6616 states and 9521 transitions. [2018-11-18 11:06:11,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 11:06:11,913 INFO L276 IsEmpty]: Start isEmpty. Operand 6616 states and 9521 transitions. [2018-11-18 11:06:11,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 11:06:11,914 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:06:11,914 INFO L375 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] [2018-11-18 11:06:11,915 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:06:11,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:11,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1287731586, now seen corresponding path program 1 times [2018-11-18 11:06:11,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:06:11,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:11,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:11,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:11,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:06:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:12,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:12,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:12,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 11:06:12,289 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:06:12,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 11:06:12,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 11:06:12,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:06:12,290 INFO L87 Difference]: Start difference. First operand 6616 states and 9521 transitions. Second operand 8 states. [2018-11-18 11:06:12,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:12,594 INFO L93 Difference]: Finished difference Result 6716 states and 9668 transitions. [2018-11-18 11:06:12,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 11:06:12,594 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-11-18 11:06:12,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:06:12,607 INFO L225 Difference]: With dead ends: 6716 [2018-11-18 11:06:12,607 INFO L226 Difference]: Without dead ends: 6669 [2018-11-18 11:06:12,611 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:06:12,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6669 states. [2018-11-18 11:06:12,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6669 to 6621. [2018-11-18 11:06:12,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6621 states. [2018-11-18 11:06:12,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6621 states to 6621 states and 9528 transitions. [2018-11-18 11:06:12,797 INFO L78 Accepts]: Start accepts. Automaton has 6621 states and 9528 transitions. Word has length 55 [2018-11-18 11:06:12,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:06:12,798 INFO L480 AbstractCegarLoop]: Abstraction has 6621 states and 9528 transitions. [2018-11-18 11:06:12,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 11:06:12,798 INFO L276 IsEmpty]: Start isEmpty. Operand 6621 states and 9528 transitions. [2018-11-18 11:06:12,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 11:06:12,799 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:06:12,800 INFO L375 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] [2018-11-18 11:06:12,800 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:06:12,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:12,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1354738339, now seen corresponding path program 1 times [2018-11-18 11:06:12,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:06:12,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:12,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:12,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:12,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:06:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:13,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:13,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:13,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:06:13,039 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:06:13,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:06:13,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:06:13,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:06:13,040 INFO L87 Difference]: Start difference. First operand 6621 states and 9528 transitions. Second operand 6 states. [2018-11-18 11:06:13,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:13,294 INFO L93 Difference]: Finished difference Result 6668 states and 9583 transitions. [2018-11-18 11:06:13,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:06:13,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-11-18 11:06:13,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:06:13,306 INFO L225 Difference]: With dead ends: 6668 [2018-11-18 11:06:13,306 INFO L226 Difference]: Without dead ends: 6621 [2018-11-18 11:06:13,308 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:06:13,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6621 states. [2018-11-18 11:06:13,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6621 to 6616. [2018-11-18 11:06:13,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6616 states. [2018-11-18 11:06:13,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6616 states to 6616 states and 9520 transitions. [2018-11-18 11:06:13,495 INFO L78 Accepts]: Start accepts. Automaton has 6616 states and 9520 transitions. Word has length 55 [2018-11-18 11:06:13,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:06:13,495 INFO L480 AbstractCegarLoop]: Abstraction has 6616 states and 9520 transitions. [2018-11-18 11:06:13,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:06:13,495 INFO L276 IsEmpty]: Start isEmpty. Operand 6616 states and 9520 transitions. [2018-11-18 11:06:13,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 11:06:13,497 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:06:13,497 INFO L375 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] [2018-11-18 11:06:13,497 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:06:13,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:13,497 INFO L82 PathProgramCache]: Analyzing trace with hash 2031400980, now seen corresponding path program 1 times [2018-11-18 11:06:13,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:06:13,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:13,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:13,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:13,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:06:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:14,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:14,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:14,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 11:06:14,047 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:06:14,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 11:06:14,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 11:06:14,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:06:14,048 INFO L87 Difference]: Start difference. First operand 6616 states and 9520 transitions. Second operand 8 states. [2018-11-18 11:06:14,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:14,222 INFO L93 Difference]: Finished difference Result 6654 states and 9568 transitions. [2018-11-18 11:06:14,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 11:06:14,223 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-18 11:06:14,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:06:14,238 INFO L225 Difference]: With dead ends: 6654 [2018-11-18 11:06:14,238 INFO L226 Difference]: Without dead ends: 6633 [2018-11-18 11:06:14,241 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:06:14,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6633 states. [2018-11-18 11:06:14,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6633 to 6621. [2018-11-18 11:06:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6621 states. [2018-11-18 11:06:14,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6621 states to 6621 states and 9525 transitions. [2018-11-18 11:06:14,424 INFO L78 Accepts]: Start accepts. Automaton has 6621 states and 9525 transitions. Word has length 51 [2018-11-18 11:06:14,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:06:14,425 INFO L480 AbstractCegarLoop]: Abstraction has 6621 states and 9525 transitions. [2018-11-18 11:06:14,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 11:06:14,425 INFO L276 IsEmpty]: Start isEmpty. Operand 6621 states and 9525 transitions. [2018-11-18 11:06:14,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 11:06:14,426 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:06:14,426 INFO L375 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] [2018-11-18 11:06:14,426 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:06:14,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:14,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1152815341, now seen corresponding path program 1 times [2018-11-18 11:06:14,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:06:14,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:14,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:14,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:14,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:06:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:14,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:14,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:14,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 11:06:14,640 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:06:14,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 11:06:14,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 11:06:14,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:06:14,641 INFO L87 Difference]: Start difference. First operand 6621 states and 9525 transitions. Second operand 8 states. [2018-11-18 11:06:14,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:14,813 INFO L93 Difference]: Finished difference Result 6648 states and 9559 transitions. [2018-11-18 11:06:14,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 11:06:14,813 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-18 11:06:14,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:06:14,831 INFO L225 Difference]: With dead ends: 6648 [2018-11-18 11:06:14,832 INFO L226 Difference]: Without dead ends: 6627 [2018-11-18 11:06:14,835 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:06:14,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6627 states. [2018-11-18 11:06:15,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6627 to 6610. [2018-11-18 11:06:15,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6610 states. [2018-11-18 11:06:15,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6610 states to 6610 states and 9511 transitions. [2018-11-18 11:06:15,145 INFO L78 Accepts]: Start accepts. Automaton has 6610 states and 9511 transitions. Word has length 51 [2018-11-18 11:06:15,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:06:15,145 INFO L480 AbstractCegarLoop]: Abstraction has 6610 states and 9511 transitions. [2018-11-18 11:06:15,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 11:06:15,146 INFO L276 IsEmpty]: Start isEmpty. Operand 6610 states and 9511 transitions. [2018-11-18 11:06:15,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 11:06:15,147 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:06:15,147 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:15,148 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:06:15,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:15,148 INFO L82 PathProgramCache]: Analyzing trace with hash -341362803, now seen corresponding path program 1 times [2018-11-18 11:06:15,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:06:15,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:15,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:15,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:15,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:06:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:15,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:15,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:15,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 11:06:15,368 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:06:15,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 11:06:15,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 11:06:15,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:06:15,368 INFO L87 Difference]: Start difference. First operand 6610 states and 9511 transitions. Second operand 8 states. [2018-11-18 11:06:16,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:16,074 INFO L93 Difference]: Finished difference Result 6858 states and 9861 transitions. [2018-11-18 11:06:16,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 11:06:16,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-11-18 11:06:16,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:06:16,091 INFO L225 Difference]: With dead ends: 6858 [2018-11-18 11:06:16,091 INFO L226 Difference]: Without dead ends: 6742 [2018-11-18 11:06:16,095 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:06:16,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6742 states. [2018-11-18 11:06:16,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6742 to 6623. [2018-11-18 11:06:16,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6623 states. [2018-11-18 11:06:16,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6623 states to 6623 states and 9530 transitions. [2018-11-18 11:06:16,303 INFO L78 Accepts]: Start accepts. Automaton has 6623 states and 9530 transitions. Word has length 56 [2018-11-18 11:06:16,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:06:16,303 INFO L480 AbstractCegarLoop]: Abstraction has 6623 states and 9530 transitions. [2018-11-18 11:06:16,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 11:06:16,303 INFO L276 IsEmpty]: Start isEmpty. Operand 6623 states and 9530 transitions. [2018-11-18 11:06:16,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 11:06:16,305 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:06:16,305 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:16,305 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:06:16,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:16,305 INFO L82 PathProgramCache]: Analyzing trace with hash 903401678, now seen corresponding path program 1 times [2018-11-18 11:06:16,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:06:16,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:16,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:16,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:16,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:06:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:16,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:16,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:16,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:06:16,508 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:06:16,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:06:16,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:06:16,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:06:16,508 INFO L87 Difference]: Start difference. First operand 6623 states and 9530 transitions. Second operand 6 states. [2018-11-18 11:06:16,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:16,822 INFO L93 Difference]: Finished difference Result 6762 states and 9701 transitions. [2018-11-18 11:06:16,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:06:16,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-11-18 11:06:16,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:06:16,835 INFO L225 Difference]: With dead ends: 6762 [2018-11-18 11:06:16,835 INFO L226 Difference]: Without dead ends: 6646 [2018-11-18 11:06:16,838 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:06:16,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6646 states. [2018-11-18 11:06:17,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6646 to 6618. [2018-11-18 11:06:17,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6618 states. [2018-11-18 11:06:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6618 states to 6618 states and 9522 transitions. [2018-11-18 11:06:17,110 INFO L78 Accepts]: Start accepts. Automaton has 6618 states and 9522 transitions. Word has length 56 [2018-11-18 11:06:17,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:06:17,110 INFO L480 AbstractCegarLoop]: Abstraction has 6618 states and 9522 transitions. [2018-11-18 11:06:17,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:06:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 6618 states and 9522 transitions. [2018-11-18 11:06:17,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 11:06:17,113 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:06:17,114 INFO L375 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] [2018-11-18 11:06:17,114 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:06:17,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:17,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1141080710, now seen corresponding path program 1 times [2018-11-18 11:06:17,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:06:17,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:17,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:17,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:17,118 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:06:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:17,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:17,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:17,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:06:17,346 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:06:17,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:06:17,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:06:17,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:06:17,347 INFO L87 Difference]: Start difference. First operand 6618 states and 9522 transitions. Second operand 5 states. [2018-11-18 11:06:17,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:17,468 INFO L93 Difference]: Finished difference Result 6633 states and 9538 transitions. [2018-11-18 11:06:17,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:06:17,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-11-18 11:06:17,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:06:17,479 INFO L225 Difference]: With dead ends: 6633 [2018-11-18 11:06:17,479 INFO L226 Difference]: Without dead ends: 6608 [2018-11-18 11:06:17,482 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:06:17,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6608 states. [2018-11-18 11:06:17,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6608 to 6608. [2018-11-18 11:06:17,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6608 states. [2018-11-18 11:06:17,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6608 states to 6608 states and 9509 transitions. [2018-11-18 11:06:17,649 INFO L78 Accepts]: Start accepts. Automaton has 6608 states and 9509 transitions. Word has length 55 [2018-11-18 11:06:17,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:06:17,650 INFO L480 AbstractCegarLoop]: Abstraction has 6608 states and 9509 transitions. [2018-11-18 11:06:17,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:06:17,650 INFO L276 IsEmpty]: Start isEmpty. Operand 6608 states and 9509 transitions. [2018-11-18 11:06:17,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-18 11:06:17,652 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:06:17,652 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:17,652 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:06:17,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:17,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1412635074, now seen corresponding path program 1 times [2018-11-18 11:06:17,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:06:17,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:17,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:17,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:17,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:06:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:17,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:17,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 11:06:17,821 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:06:17,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 11:06:17,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 11:06:17,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:06:17,822 INFO L87 Difference]: Start difference. First operand 6608 states and 9509 transitions. Second operand 7 states. [2018-11-18 11:06:18,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:18,160 INFO L93 Difference]: Finished difference Result 6711 states and 9642 transitions. [2018-11-18 11:06:18,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 11:06:18,161 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-11-18 11:06:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:06:18,172 INFO L225 Difference]: With dead ends: 6711 [2018-11-18 11:06:18,173 INFO L226 Difference]: Without dead ends: 6660 [2018-11-18 11:06:18,175 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:06:18,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6660 states. [2018-11-18 11:06:18,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6660 to 6613. [2018-11-18 11:06:18,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6613 states. [2018-11-18 11:06:18,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6613 states to 6613 states and 9514 transitions. [2018-11-18 11:06:18,356 INFO L78 Accepts]: Start accepts. Automaton has 6613 states and 9514 transitions. Word has length 61 [2018-11-18 11:06:18,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:06:18,356 INFO L480 AbstractCegarLoop]: Abstraction has 6613 states and 9514 transitions. [2018-11-18 11:06:18,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 11:06:18,356 INFO L276 IsEmpty]: Start isEmpty. Operand 6613 states and 9514 transitions. [2018-11-18 11:06:18,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-18 11:06:18,358 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:06:18,358 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:18,358 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:06:18,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:18,358 INFO L82 PathProgramCache]: Analyzing trace with hash -387143075, now seen corresponding path program 1 times [2018-11-18 11:06:18,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:06:18,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:18,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:18,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:18,362 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:06:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:18,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:18,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:18,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:06:18,507 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:06:18,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:06:18,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:06:18,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:06:18,508 INFO L87 Difference]: Start difference. First operand 6613 states and 9514 transitions. Second operand 6 states. [2018-11-18 11:06:18,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:18,665 INFO L93 Difference]: Finished difference Result 6631 states and 9533 transitions. [2018-11-18 11:06:18,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:06:18,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-11-18 11:06:18,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:06:18,677 INFO L225 Difference]: With dead ends: 6631 [2018-11-18 11:06:18,678 INFO L226 Difference]: Without dead ends: 6611 [2018-11-18 11:06:18,680 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:06:18,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6611 states. [2018-11-18 11:06:18,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6611 to 6606. [2018-11-18 11:06:18,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6606 states. [2018-11-18 11:06:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6606 states to 6606 states and 9505 transitions. [2018-11-18 11:06:18,864 INFO L78 Accepts]: Start accepts. Automaton has 6606 states and 9505 transitions. Word has length 61 [2018-11-18 11:06:18,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:06:18,864 INFO L480 AbstractCegarLoop]: Abstraction has 6606 states and 9505 transitions. [2018-11-18 11:06:18,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:06:18,864 INFO L276 IsEmpty]: Start isEmpty. Operand 6606 states and 9505 transitions. [2018-11-18 11:06:18,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 11:06:18,865 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:06:18,866 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:18,866 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:06:18,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:18,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1022560364, now seen corresponding path program 1 times [2018-11-18 11:06:18,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:06:18,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:18,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:18,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:18,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:06:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:18,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:18,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:18,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 11:06:18,988 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:06:18,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 11:06:18,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 11:06:18,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:06:18,988 INFO L87 Difference]: Start difference. First operand 6606 states and 9505 transitions. Second operand 8 states. [2018-11-18 11:06:19,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:19,167 INFO L93 Difference]: Finished difference Result 6624 states and 9524 transitions. [2018-11-18 11:06:19,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 11:06:19,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-11-18 11:06:19,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:06:19,181 INFO L225 Difference]: With dead ends: 6624 [2018-11-18 11:06:19,182 INFO L226 Difference]: Without dead ends: 6599 [2018-11-18 11:06:19,186 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:06:19,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6599 states. [2018-11-18 11:06:19,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6599 to 6599. [2018-11-18 11:06:19,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6599 states. [2018-11-18 11:06:19,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6599 states to 6599 states and 9490 transitions. [2018-11-18 11:06:19,389 INFO L78 Accepts]: Start accepts. Automaton has 6599 states and 9490 transitions. Word has length 60 [2018-11-18 11:06:19,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:06:19,390 INFO L480 AbstractCegarLoop]: Abstraction has 6599 states and 9490 transitions. [2018-11-18 11:06:19,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 11:06:19,390 INFO L276 IsEmpty]: Start isEmpty. Operand 6599 states and 9490 transitions. [2018-11-18 11:06:19,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-18 11:06:19,391 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:06:19,392 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:19,392 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:06:19,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:19,392 INFO L82 PathProgramCache]: Analyzing trace with hash -2063597915, now seen corresponding path program 1 times [2018-11-18 11:06:19,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:06:19,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:19,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:19,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:19,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:06:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:19,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:19,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:19,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 11:06:19,507 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:06:19,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 11:06:19,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 11:06:19,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:06:19,507 INFO L87 Difference]: Start difference. First operand 6599 states and 9490 transitions. Second operand 9 states. [2018-11-18 11:07:10,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:07:10,908 INFO L93 Difference]: Finished difference Result 7920 states and 11373 transitions. [2018-11-18 11:07:10,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 11:07:10,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-18 11:07:10,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:07:10,922 INFO L225 Difference]: With dead ends: 7920 [2018-11-18 11:07:10,922 INFO L226 Difference]: Without dead ends: 7794 [2018-11-18 11:07:10,925 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-11-18 11:07:10,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7794 states. [2018-11-18 11:07:11,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7794 to 6607. [2018-11-18 11:07:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6607 states. [2018-11-18 11:07:11,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6607 states to 6607 states and 9496 transitions. [2018-11-18 11:07:11,121 INFO L78 Accepts]: Start accepts. Automaton has 6607 states and 9496 transitions. Word has length 61 [2018-11-18 11:07:11,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:07:11,121 INFO L480 AbstractCegarLoop]: Abstraction has 6607 states and 9496 transitions. [2018-11-18 11:07:11,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 11:07:11,121 INFO L276 IsEmpty]: Start isEmpty. Operand 6607 states and 9496 transitions. [2018-11-18 11:07:11,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-18 11:07:11,122 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:07:11,122 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:07:11,122 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:07:11,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:07:11,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1600547935, now seen corresponding path program 1 times [2018-11-18 11:07:11,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:07:11,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:07:11,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:07:11,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:07:11,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:07:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:11,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:07:11,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:07:11,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:07:11,181 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:07:11,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:07:11,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:07:11,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:07:11,181 INFO L87 Difference]: Start difference. First operand 6607 states and 9496 transitions. Second operand 3 states. [2018-11-18 11:07:11,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:07:11,661 INFO L93 Difference]: Finished difference Result 6713 states and 9629 transitions. [2018-11-18 11:07:11,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:07:11,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-11-18 11:07:11,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:07:11,677 INFO L225 Difference]: With dead ends: 6713 [2018-11-18 11:07:11,677 INFO L226 Difference]: Without dead ends: 6630 [2018-11-18 11:07:11,680 INFO L604 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 [2018-11-18 11:07:11,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6630 states. [2018-11-18 11:07:11,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6630 to 6603. [2018-11-18 11:07:11,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6603 states. [2018-11-18 11:07:11,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6603 states to 6603 states and 9488 transitions. [2018-11-18 11:07:11,879 INFO L78 Accepts]: Start accepts. Automaton has 6603 states and 9488 transitions. Word has length 64 [2018-11-18 11:07:11,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:07:11,880 INFO L480 AbstractCegarLoop]: Abstraction has 6603 states and 9488 transitions. [2018-11-18 11:07:11,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:07:11,880 INFO L276 IsEmpty]: Start isEmpty. Operand 6603 states and 9488 transitions. [2018-11-18 11:07:11,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-18 11:07:11,881 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:07:11,881 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:07:11,882 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:07:11,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:07:11,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1497763366, now seen corresponding path program 1 times [2018-11-18 11:07:11,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:07:11,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:07:11,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:07:11,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:07:11,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:07:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:07:11,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:07:11,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:07:11,971 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:07:11,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:07:11,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:07:11,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:07:11,971 INFO L87 Difference]: Start difference. First operand 6603 states and 9488 transitions. Second operand 6 states. [2018-11-18 11:07:12,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:07:12,470 INFO L93 Difference]: Finished difference Result 6793 states and 9708 transitions. [2018-11-18 11:07:12,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:07:12,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-11-18 11:07:12,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:07:12,493 INFO L225 Difference]: With dead ends: 6793 [2018-11-18 11:07:12,493 INFO L226 Difference]: Without dead ends: 5773 [2018-11-18 11:07:12,503 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:07:12,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5773 states. [2018-11-18 11:07:12,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5773 to 5719. [2018-11-18 11:07:12,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5719 states. [2018-11-18 11:07:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5719 states to 5719 states and 8187 transitions. [2018-11-18 11:07:12,740 INFO L78 Accepts]: Start accepts. Automaton has 5719 states and 8187 transitions. Word has length 78 [2018-11-18 11:07:12,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:07:12,741 INFO L480 AbstractCegarLoop]: Abstraction has 5719 states and 8187 transitions. [2018-11-18 11:07:12,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:07:12,741 INFO L276 IsEmpty]: Start isEmpty. Operand 5719 states and 8187 transitions. [2018-11-18 11:07:12,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 11:07:12,743 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:07:12,743 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:07:12,743 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:07:12,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:07:12,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2069075580, now seen corresponding path program 1 times [2018-11-18 11:07:12,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:07:12,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:07:12,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:07:12,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:07:12,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:07:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:12,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:07:12,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:07:12,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:07:12,841 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:07:12,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:07:12,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:07:12,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:07:12,842 INFO L87 Difference]: Start difference. First operand 5719 states and 8187 transitions. Second operand 6 states. [2018-11-18 11:07:13,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:07:13,016 INFO L93 Difference]: Finished difference Result 5777 states and 8248 transitions. [2018-11-18 11:07:13,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:07:13,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-11-18 11:07:13,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:07:13,027 INFO L225 Difference]: With dead ends: 5777 [2018-11-18 11:07:13,027 INFO L226 Difference]: Without dead ends: 5709 [2018-11-18 11:07:13,030 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:07:13,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5709 states. [2018-11-18 11:07:13,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5709 to 5709. [2018-11-18 11:07:13,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5709 states. [2018-11-18 11:07:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 8174 transitions. [2018-11-18 11:07:13,227 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 8174 transitions. Word has length 71 [2018-11-18 11:07:13,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:07:13,227 INFO L480 AbstractCegarLoop]: Abstraction has 5709 states and 8174 transitions. [2018-11-18 11:07:13,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:07:13,227 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 8174 transitions. [2018-11-18 11:07:13,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 11:07:13,229 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:07:13,230 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:07:13,230 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:07:13,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:07:13,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1851750902, now seen corresponding path program 1 times [2018-11-18 11:07:13,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:07:13,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:07:13,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:07:13,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:07:13,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:07:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:13,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:07:13,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:07:13,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:07:13,302 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:07:13,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:07:13,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:07:13,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:07:13,303 INFO L87 Difference]: Start difference. First operand 5709 states and 8174 transitions. Second operand 3 states. [2018-11-18 11:07:13,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:07:13,606 INFO L93 Difference]: Finished difference Result 7037 states and 10071 transitions. [2018-11-18 11:07:13,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:07:13,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-18 11:07:13,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:07:13,620 INFO L225 Difference]: With dead ends: 7037 [2018-11-18 11:07:13,621 INFO L226 Difference]: Without dead ends: 7024 [2018-11-18 11:07:13,624 INFO L604 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 [2018-11-18 11:07:13,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7024 states. [2018-11-18 11:07:13,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7024 to 5838. [2018-11-18 11:07:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5838 states. [2018-11-18 11:07:13,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5838 states to 5838 states and 8321 transitions. [2018-11-18 11:07:13,854 INFO L78 Accepts]: Start accepts. Automaton has 5838 states and 8321 transitions. Word has length 63 [2018-11-18 11:07:13,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:07:13,854 INFO L480 AbstractCegarLoop]: Abstraction has 5838 states and 8321 transitions. [2018-11-18 11:07:13,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:07:13,855 INFO L276 IsEmpty]: Start isEmpty. Operand 5838 states and 8321 transitions. [2018-11-18 11:07:13,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 11:07:13,857 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:07:13,857 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:07:13,857 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:07:13,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:07:13,858 INFO L82 PathProgramCache]: Analyzing trace with hash -415316726, now seen corresponding path program 1 times [2018-11-18 11:07:13,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:07:13,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:07:13,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:07:13,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:07:13,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:07:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:14,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:07:14,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:07:14,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 11:07:14,044 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:07:14,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 11:07:14,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 11:07:14,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:07:14,045 INFO L87 Difference]: Start difference. First operand 5838 states and 8321 transitions. Second operand 7 states. [2018-11-18 11:07:32,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:07:32,410 INFO L93 Difference]: Finished difference Result 5925 states and 8420 transitions. [2018-11-18 11:07:32,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 11:07:32,410 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2018-11-18 11:07:32,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:07:32,421 INFO L225 Difference]: With dead ends: 5925 [2018-11-18 11:07:32,421 INFO L226 Difference]: Without dead ends: 5690 [2018-11-18 11:07:32,424 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:07:32,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5690 states. [2018-11-18 11:07:32,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5690 to 5676. [2018-11-18 11:07:32,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5676 states. [2018-11-18 11:07:32,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5676 states to 5676 states and 8129 transitions. [2018-11-18 11:07:32,686 INFO L78 Accepts]: Start accepts. Automaton has 5676 states and 8129 transitions. Word has length 63 [2018-11-18 11:07:32,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:07:32,686 INFO L480 AbstractCegarLoop]: Abstraction has 5676 states and 8129 transitions. [2018-11-18 11:07:32,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 11:07:32,687 INFO L276 IsEmpty]: Start isEmpty. Operand 5676 states and 8129 transitions. [2018-11-18 11:07:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 11:07:32,688 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:07:32,688 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:07:32,688 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:07:32,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:07:32,689 INFO L82 PathProgramCache]: Analyzing trace with hash 248165905, now seen corresponding path program 1 times [2018-11-18 11:07:32,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:07:32,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:07:32,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:07:32,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:07:32,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:07:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:32,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:07:32,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:07:32,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:07:32,833 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:07:32,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:07:32,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:07:32,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:07:32,834 INFO L87 Difference]: Start difference. First operand 5676 states and 8129 transitions. Second operand 6 states. [2018-11-18 11:07:33,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:07:33,022 INFO L93 Difference]: Finished difference Result 5695 states and 8149 transitions. [2018-11-18 11:07:33,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:07:33,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-11-18 11:07:33,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:07:33,036 INFO L225 Difference]: With dead ends: 5695 [2018-11-18 11:07:33,036 INFO L226 Difference]: Without dead ends: 5669 [2018-11-18 11:07:33,039 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:07:33,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5669 states. [2018-11-18 11:07:33,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5669 to 5665. [2018-11-18 11:07:33,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5665 states. [2018-11-18 11:07:33,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5665 states to 5665 states and 8115 transitions. [2018-11-18 11:07:33,237 INFO L78 Accepts]: Start accepts. Automaton has 5665 states and 8115 transitions. Word has length 73 [2018-11-18 11:07:33,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:07:33,237 INFO L480 AbstractCegarLoop]: Abstraction has 5665 states and 8115 transitions. [2018-11-18 11:07:33,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:07:33,237 INFO L276 IsEmpty]: Start isEmpty. Operand 5665 states and 8115 transitions. [2018-11-18 11:07:33,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-18 11:07:33,239 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:07:33,239 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:07:33,239 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:07:33,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:07:33,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1118764344, now seen corresponding path program 1 times [2018-11-18 11:07:33,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:07:33,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:07:33,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:07:33,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:07:33,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:07:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:33,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:07:33,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:07:33,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 11:07:33,354 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:07:33,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 11:07:33,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 11:07:33,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:07:33,355 INFO L87 Difference]: Start difference. First operand 5665 states and 8115 transitions. Second operand 9 states. [2018-11-18 11:07:47,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:07:47,727 INFO L93 Difference]: Finished difference Result 5684 states and 8136 transitions. [2018-11-18 11:07:47,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 11:07:47,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-11-18 11:07:47,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:07:47,737 INFO L225 Difference]: With dead ends: 5684 [2018-11-18 11:07:47,738 INFO L226 Difference]: Without dead ends: 5680 [2018-11-18 11:07:47,740 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:07:47,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5680 states. [2018-11-18 11:07:47,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5680 to 5676. [2018-11-18 11:07:47,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5676 states. [2018-11-18 11:07:47,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5676 states to 5676 states and 8128 transitions. [2018-11-18 11:07:47,968 INFO L78 Accepts]: Start accepts. Automaton has 5676 states and 8128 transitions. Word has length 64 [2018-11-18 11:07:47,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:07:47,969 INFO L480 AbstractCegarLoop]: Abstraction has 5676 states and 8128 transitions. [2018-11-18 11:07:47,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 11:07:47,969 INFO L276 IsEmpty]: Start isEmpty. Operand 5676 states and 8128 transitions. [2018-11-18 11:07:47,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-18 11:07:47,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:07:47,971 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:07:47,971 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:07:47,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:07:47,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1119041174, now seen corresponding path program 1 times [2018-11-18 11:07:47,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:07:47,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:07:47,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:07:47,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:07:47,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:07:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:48,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:07:48,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:07:48,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:07:48,047 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:07:48,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:07:48,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:07:48,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:07:48,048 INFO L87 Difference]: Start difference. First operand 5676 states and 8128 transitions. Second operand 6 states. [2018-11-18 11:07:56,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:07:56,282 INFO L93 Difference]: Finished difference Result 6868 states and 9866 transitions. [2018-11-18 11:07:56,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:07:56,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-18 11:07:56,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:07:56,294 INFO L225 Difference]: With dead ends: 6868 [2018-11-18 11:07:56,294 INFO L226 Difference]: Without dead ends: 6847 [2018-11-18 11:07:56,296 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:07:56,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6847 states. [2018-11-18 11:07:56,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6847 to 5663. [2018-11-18 11:07:56,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5663 states. [2018-11-18 11:07:56,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5663 states to 5663 states and 8110 transitions. [2018-11-18 11:07:56,502 INFO L78 Accepts]: Start accepts. Automaton has 5663 states and 8110 transitions. Word has length 64 [2018-11-18 11:07:56,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:07:56,503 INFO L480 AbstractCegarLoop]: Abstraction has 5663 states and 8110 transitions. [2018-11-18 11:07:56,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:07:56,503 INFO L276 IsEmpty]: Start isEmpty. Operand 5663 states and 8110 transitions. [2018-11-18 11:07:56,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 11:07:56,504 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:07:56,504 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:07:56,504 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:07:56,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:07:56,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1655162215, now seen corresponding path program 1 times [2018-11-18 11:07:56,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:07:56,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:07:56,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:07:56,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:07:56,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:07:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:56,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:07:56,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:07:56,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:07:56,695 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:07:56,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:07:56,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:07:56,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:07:56,696 INFO L87 Difference]: Start difference. First operand 5663 states and 8110 transitions. Second operand 5 states. [2018-11-18 11:07:57,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:07:57,743 INFO L93 Difference]: Finished difference Result 5716 states and 8170 transitions. [2018-11-18 11:07:57,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 11:07:57,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-11-18 11:07:57,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:07:57,751 INFO L225 Difference]: With dead ends: 5716 [2018-11-18 11:07:57,752 INFO L226 Difference]: Without dead ends: 5712 [2018-11-18 11:07:57,753 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:07:57,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5712 states. [2018-11-18 11:07:57,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5712 to 5661. [2018-11-18 11:07:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5661 states. [2018-11-18 11:07:57,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5661 states to 5661 states and 8106 transitions. [2018-11-18 11:07:57,959 INFO L78 Accepts]: Start accepts. Automaton has 5661 states and 8106 transitions. Word has length 70 [2018-11-18 11:07:57,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:07:57,959 INFO L480 AbstractCegarLoop]: Abstraction has 5661 states and 8106 transitions. [2018-11-18 11:07:57,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:07:57,959 INFO L276 IsEmpty]: Start isEmpty. Operand 5661 states and 8106 transitions. [2018-11-18 11:07:57,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 11:07:57,960 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:07:57,960 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:07:57,960 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:07:57,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:07:57,960 INFO L82 PathProgramCache]: Analyzing trace with hash 373493434, now seen corresponding path program 1 times [2018-11-18 11:07:57,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:07:57,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:07:57,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:07:57,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:07:57,964 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:07:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:07:58,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:07:58,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:07:58,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 11:07:58,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:07:58,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 11:07:58,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 11:07:58,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:07:58,081 INFO L87 Difference]: Start difference. First operand 5661 states and 8106 transitions. Second operand 9 states. [2018-11-18 11:08:12,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:12,437 INFO L93 Difference]: Finished difference Result 5674 states and 8120 transitions. [2018-11-18 11:08:12,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 11:08:12,437 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2018-11-18 11:08:12,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:08:12,448 INFO L225 Difference]: With dead ends: 5674 [2018-11-18 11:08:12,448 INFO L226 Difference]: Without dead ends: 5639 [2018-11-18 11:08:12,450 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:08:12,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2018-11-18 11:08:12,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5639. [2018-11-18 11:08:12,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5639 states. [2018-11-18 11:08:12,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5639 states to 5639 states and 8081 transitions. [2018-11-18 11:08:12,697 INFO L78 Accepts]: Start accepts. Automaton has 5639 states and 8081 transitions. Word has length 65 [2018-11-18 11:08:12,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:08:12,698 INFO L480 AbstractCegarLoop]: Abstraction has 5639 states and 8081 transitions. [2018-11-18 11:08:12,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 11:08:12,698 INFO L276 IsEmpty]: Start isEmpty. Operand 5639 states and 8081 transitions. [2018-11-18 11:08:12,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 11:08:12,700 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:08:12,700 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:08:12,700 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:08:12,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:12,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1243854317, now seen corresponding path program 1 times [2018-11-18 11:08:12,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:08:12,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:12,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:12,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:12,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:08:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:12,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:12,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:08:12,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:08:12,796 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:08:12,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:08:12,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:08:12,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:08:12,797 INFO L87 Difference]: Start difference. First operand 5639 states and 8081 transitions. Second operand 3 states. [2018-11-18 11:08:15,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:15,077 INFO L93 Difference]: Finished difference Result 8308 states and 11892 transitions. [2018-11-18 11:08:15,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:08:15,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-11-18 11:08:15,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:08:15,094 INFO L225 Difference]: With dead ends: 8308 [2018-11-18 11:08:15,094 INFO L226 Difference]: Without dead ends: 8170 [2018-11-18 11:08:15,097 INFO L604 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 [2018-11-18 11:08:15,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8170 states. [2018-11-18 11:08:15,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8170 to 5642. [2018-11-18 11:08:15,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5642 states. [2018-11-18 11:08:15,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 8081 transitions. [2018-11-18 11:08:15,372 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 8081 transitions. Word has length 71 [2018-11-18 11:08:15,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:08:15,372 INFO L480 AbstractCegarLoop]: Abstraction has 5642 states and 8081 transitions. [2018-11-18 11:08:15,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:08:15,373 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 8081 transitions. [2018-11-18 11:08:15,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 11:08:15,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:08:15,374 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:08:15,375 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:08:15,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:15,375 INFO L82 PathProgramCache]: Analyzing trace with hash 493123800, now seen corresponding path program 1 times [2018-11-18 11:08:15,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:08:15,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:15,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:15,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:15,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:08:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:15,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:08:15,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:08:15,477 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:08:15,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:08:15,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:08:15,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:08:15,478 INFO L87 Difference]: Start difference. First operand 5642 states and 8081 transitions. Second operand 5 states. [2018-11-18 11:08:18,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:18,991 INFO L93 Difference]: Finished difference Result 6529 states and 9302 transitions. [2018-11-18 11:08:18,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:08:18,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-11-18 11:08:18,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:08:18,998 INFO L225 Difference]: With dead ends: 6529 [2018-11-18 11:08:18,998 INFO L226 Difference]: Without dead ends: 4055 [2018-11-18 11:08:19,003 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:08:19,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4055 states. [2018-11-18 11:08:19,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4055 to 3929. [2018-11-18 11:08:19,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3929 states. [2018-11-18 11:08:19,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3929 states to 3929 states and 5577 transitions. [2018-11-18 11:08:19,175 INFO L78 Accepts]: Start accepts. Automaton has 3929 states and 5577 transitions. Word has length 79 [2018-11-18 11:08:19,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:08:19,175 INFO L480 AbstractCegarLoop]: Abstraction has 3929 states and 5577 transitions. [2018-11-18 11:08:19,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:08:19,175 INFO L276 IsEmpty]: Start isEmpty. Operand 3929 states and 5577 transitions. [2018-11-18 11:08:19,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 11:08:19,176 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:08:19,176 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:08:19,176 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:08:19,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:19,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1678161400, now seen corresponding path program 1 times [2018-11-18 11:08:19,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:08:19,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:19,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:19,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:19,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:08:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:19,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:19,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:08:19,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:08:19,247 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:08:19,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:08:19,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:08:19,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:08:19,248 INFO L87 Difference]: Start difference. First operand 3929 states and 5577 transitions. Second operand 3 states. [2018-11-18 11:08:19,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:19,523 INFO L93 Difference]: Finished difference Result 6493 states and 9270 transitions. [2018-11-18 11:08:19,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:08:19,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-11-18 11:08:19,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:08:19,531 INFO L225 Difference]: With dead ends: 6493 [2018-11-18 11:08:19,531 INFO L226 Difference]: Without dead ends: 4011 [2018-11-18 11:08:19,536 INFO L604 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 [2018-11-18 11:08:19,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4011 states. [2018-11-18 11:08:19,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4011 to 3924. [2018-11-18 11:08:19,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3924 states. [2018-11-18 11:08:19,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3924 states to 3924 states and 5567 transitions. [2018-11-18 11:08:19,730 INFO L78 Accepts]: Start accepts. Automaton has 3924 states and 5567 transitions. Word has length 80 [2018-11-18 11:08:19,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:08:19,730 INFO L480 AbstractCegarLoop]: Abstraction has 3924 states and 5567 transitions. [2018-11-18 11:08:19,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:08:19,730 INFO L276 IsEmpty]: Start isEmpty. Operand 3924 states and 5567 transitions. [2018-11-18 11:08:19,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 11:08:19,731 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:08:19,732 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:08:19,732 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:08:19,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:19,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1447548503, now seen corresponding path program 1 times [2018-11-18 11:08:19,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:08:19,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:19,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:19,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:19,735 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:08:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:19,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:08:19,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:08:19,823 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:08:19,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:08:19,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:08:19,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:08:19,824 INFO L87 Difference]: Start difference. First operand 3924 states and 5567 transitions. Second operand 6 states. [2018-11-18 11:08:20,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:20,062 INFO L93 Difference]: Finished difference Result 3992 states and 5649 transitions. [2018-11-18 11:08:20,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:08:20,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-11-18 11:08:20,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:08:20,069 INFO L225 Difference]: With dead ends: 3992 [2018-11-18 11:08:20,069 INFO L226 Difference]: Without dead ends: 3548 [2018-11-18 11:08:20,071 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:08:20,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2018-11-18 11:08:20,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3519. [2018-11-18 11:08:20,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3519 states. [2018-11-18 11:08:20,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3519 states to 3519 states and 4933 transitions. [2018-11-18 11:08:20,254 INFO L78 Accepts]: Start accepts. Automaton has 3519 states and 4933 transitions. Word has length 81 [2018-11-18 11:08:20,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:08:20,254 INFO L480 AbstractCegarLoop]: Abstraction has 3519 states and 4933 transitions. [2018-11-18 11:08:20,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:08:20,255 INFO L276 IsEmpty]: Start isEmpty. Operand 3519 states and 4933 transitions. [2018-11-18 11:08:20,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-18 11:08:20,256 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:08:20,256 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:08:20,256 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:08:20,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:20,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1931068484, now seen corresponding path program 1 times [2018-11-18 11:08:20,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:08:20,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:20,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:20,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:20,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:08:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:20,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:20,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:08:20,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 11:08:20,409 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:08:20,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 11:08:20,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 11:08:20,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:08:20,410 INFO L87 Difference]: Start difference. First operand 3519 states and 4933 transitions. Second operand 11 states. [2018-11-18 11:08:20,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:20,716 INFO L93 Difference]: Finished difference Result 3552 states and 4973 transitions. [2018-11-18 11:08:20,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 11:08:20,717 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2018-11-18 11:08:20,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:08:20,723 INFO L225 Difference]: With dead ends: 3552 [2018-11-18 11:08:20,723 INFO L226 Difference]: Without dead ends: 3526 [2018-11-18 11:08:20,724 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:08:20,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3526 states. [2018-11-18 11:08:20,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3526 to 3526. [2018-11-18 11:08:20,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3526 states. [2018-11-18 11:08:20,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 4942 transitions. [2018-11-18 11:08:20,919 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 4942 transitions. Word has length 75 [2018-11-18 11:08:20,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:08:20,920 INFO L480 AbstractCegarLoop]: Abstraction has 3526 states and 4942 transitions. [2018-11-18 11:08:20,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 11:08:20,920 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 4942 transitions. [2018-11-18 11:08:20,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-18 11:08:20,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:08:20,921 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:08:20,921 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:08:20,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:20,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1690528355, now seen corresponding path program 1 times [2018-11-18 11:08:20,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:08:20,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:20,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:20,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:20,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:08:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:21,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:08:21,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 11:08:21,068 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:08:21,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 11:08:21,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 11:08:21,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:08:21,069 INFO L87 Difference]: Start difference. First operand 3526 states and 4942 transitions. Second operand 11 states. [2018-11-18 11:08:21,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:21,357 INFO L93 Difference]: Finished difference Result 3541 states and 4958 transitions. [2018-11-18 11:08:21,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 11:08:21,358 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2018-11-18 11:08:21,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:08:21,364 INFO L225 Difference]: With dead ends: 3541 [2018-11-18 11:08:21,364 INFO L226 Difference]: Without dead ends: 3501 [2018-11-18 11:08:21,365 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:08:21,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3501 states. [2018-11-18 11:08:21,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3501 to 3494. [2018-11-18 11:08:21,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2018-11-18 11:08:21,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 4905 transitions. [2018-11-18 11:08:21,576 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 4905 transitions. Word has length 75 [2018-11-18 11:08:21,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:08:21,576 INFO L480 AbstractCegarLoop]: Abstraction has 3494 states and 4905 transitions. [2018-11-18 11:08:21,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 11:08:21,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 4905 transitions. [2018-11-18 11:08:21,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-18 11:08:21,578 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:08:21,578 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:08:21,578 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:08:21,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:21,578 INFO L82 PathProgramCache]: Analyzing trace with hash 394516456, now seen corresponding path program 1 times [2018-11-18 11:08:21,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:08:21,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:21,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:21,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:21,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:08:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:21,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:21,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:08:21,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:08:21,668 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:08:21,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:08:21,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:08:21,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:08:21,668 INFO L87 Difference]: Start difference. First operand 3494 states and 4905 transitions. Second operand 5 states. [2018-11-18 11:08:21,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:21,828 INFO L93 Difference]: Finished difference Result 3585 states and 5009 transitions. [2018-11-18 11:08:21,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:08:21,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-11-18 11:08:21,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:08:21,834 INFO L225 Difference]: With dead ends: 3585 [2018-11-18 11:08:21,834 INFO L226 Difference]: Without dead ends: 3464 [2018-11-18 11:08:21,836 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:08:21,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3464 states. [2018-11-18 11:08:22,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3464 to 3464. [2018-11-18 11:08:22,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3464 states. [2018-11-18 11:08:22,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3464 states to 3464 states and 4868 transitions. [2018-11-18 11:08:22,021 INFO L78 Accepts]: Start accepts. Automaton has 3464 states and 4868 transitions. Word has length 78 [2018-11-18 11:08:22,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:08:22,021 INFO L480 AbstractCegarLoop]: Abstraction has 3464 states and 4868 transitions. [2018-11-18 11:08:22,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:08:22,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3464 states and 4868 transitions. [2018-11-18 11:08:22,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-18 11:08:22,023 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:08:22,023 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:08:22,023 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:08:22,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:22,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1622189246, now seen corresponding path program 1 times [2018-11-18 11:08:22,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:08:22,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:22,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:22,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:22,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:08:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:22,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:22,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:08:22,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:08:22,101 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:08:22,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:08:22,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:08:22,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:08:22,102 INFO L87 Difference]: Start difference. First operand 3464 states and 4868 transitions. Second operand 6 states. [2018-11-18 11:08:22,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:22,295 INFO L93 Difference]: Finished difference Result 3520 states and 4932 transitions. [2018-11-18 11:08:22,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 11:08:22,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-11-18 11:08:22,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:08:22,302 INFO L225 Difference]: With dead ends: 3520 [2018-11-18 11:08:22,302 INFO L226 Difference]: Without dead ends: 3464 [2018-11-18 11:08:22,304 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:08:22,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3464 states. [2018-11-18 11:08:22,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3464 to 3464. [2018-11-18 11:08:22,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3464 states. [2018-11-18 11:08:22,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3464 states to 3464 states and 4864 transitions. [2018-11-18 11:08:22,496 INFO L78 Accepts]: Start accepts. Automaton has 3464 states and 4864 transitions. Word has length 78 [2018-11-18 11:08:22,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:08:22,496 INFO L480 AbstractCegarLoop]: Abstraction has 3464 states and 4864 transitions. [2018-11-18 11:08:22,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:08:22,496 INFO L276 IsEmpty]: Start isEmpty. Operand 3464 states and 4864 transitions. [2018-11-18 11:08:22,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 11:08:22,497 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:08:22,497 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:08:22,497 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:08:22,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:22,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1237483932, now seen corresponding path program 1 times [2018-11-18 11:08:22,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:08:22,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:22,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:22,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:22,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:08:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:22,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:22,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:08:22,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:08:22,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:08:22,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:08:22,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:08:22,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:08:22,575 INFO L87 Difference]: Start difference. First operand 3464 states and 4864 transitions. Second operand 6 states. [2018-11-18 11:08:22,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:22,766 INFO L93 Difference]: Finished difference Result 3524 states and 4933 transitions. [2018-11-18 11:08:22,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:08:22,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-11-18 11:08:22,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:08:22,772 INFO L225 Difference]: With dead ends: 3524 [2018-11-18 11:08:22,772 INFO L226 Difference]: Without dead ends: 3464 [2018-11-18 11:08:22,773 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:08:22,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3464 states. [2018-11-18 11:08:22,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3464 to 3464. [2018-11-18 11:08:22,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3464 states. [2018-11-18 11:08:22,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3464 states to 3464 states and 4862 transitions. [2018-11-18 11:08:22,949 INFO L78 Accepts]: Start accepts. Automaton has 3464 states and 4862 transitions. Word has length 79 [2018-11-18 11:08:22,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:08:22,950 INFO L480 AbstractCegarLoop]: Abstraction has 3464 states and 4862 transitions. [2018-11-18 11:08:22,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:08:22,950 INFO L276 IsEmpty]: Start isEmpty. Operand 3464 states and 4862 transitions. [2018-11-18 11:08:22,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 11:08:22,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:08:22,951 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:08:22,951 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:08:22,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:22,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1862062037, now seen corresponding path program 1 times [2018-11-18 11:08:22,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:08:22,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:22,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:22,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:22,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:08:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:23,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:23,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:08:23,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:08:23,026 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:08:23,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:08:23,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:08:23,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:08:23,027 INFO L87 Difference]: Start difference. First operand 3464 states and 4862 transitions. Second operand 3 states. [2018-11-18 11:08:25,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:25,217 INFO L93 Difference]: Finished difference Result 3515 states and 4920 transitions. [2018-11-18 11:08:25,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:08:25,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-11-18 11:08:25,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:08:25,224 INFO L225 Difference]: With dead ends: 3515 [2018-11-18 11:08:25,224 INFO L226 Difference]: Without dead ends: 3466 [2018-11-18 11:08:25,226 INFO L604 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 [2018-11-18 11:08:25,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3466 states. [2018-11-18 11:08:25,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3466 to 3464. [2018-11-18 11:08:25,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3464 states. [2018-11-18 11:08:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3464 states to 3464 states and 4861 transitions. [2018-11-18 11:08:25,418 INFO L78 Accepts]: Start accepts. Automaton has 3464 states and 4861 transitions. Word has length 84 [2018-11-18 11:08:25,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:08:25,418 INFO L480 AbstractCegarLoop]: Abstraction has 3464 states and 4861 transitions. [2018-11-18 11:08:25,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:08:25,418 INFO L276 IsEmpty]: Start isEmpty. Operand 3464 states and 4861 transitions. [2018-11-18 11:08:25,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 11:08:25,420 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:08:25,420 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:08:25,420 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:08:25,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:25,421 INFO L82 PathProgramCache]: Analyzing trace with hash -31151358, now seen corresponding path program 1 times [2018-11-18 11:08:25,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:08:25,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:25,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:25,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:25,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:08:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:25,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:25,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:08:25,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:08:25,480 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:08:25,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:08:25,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:08:25,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:08:25,481 INFO L87 Difference]: Start difference. First operand 3464 states and 4861 transitions. Second operand 3 states. [2018-11-18 11:08:25,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:25,650 INFO L93 Difference]: Finished difference Result 3536 states and 4943 transitions. [2018-11-18 11:08:25,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:08:25,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-11-18 11:08:25,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:08:25,657 INFO L225 Difference]: With dead ends: 3536 [2018-11-18 11:08:25,657 INFO L226 Difference]: Without dead ends: 3477 [2018-11-18 11:08:25,659 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:08:25,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3477 states. [2018-11-18 11:08:25,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3477 to 3469. [2018-11-18 11:08:25,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3469 states. [2018-11-18 11:08:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3469 states to 3469 states and 4868 transitions. [2018-11-18 11:08:25,844 INFO L78 Accepts]: Start accepts. Automaton has 3469 states and 4868 transitions. Word has length 84 [2018-11-18 11:08:25,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:08:25,844 INFO L480 AbstractCegarLoop]: Abstraction has 3469 states and 4868 transitions. [2018-11-18 11:08:25,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:08:25,844 INFO L276 IsEmpty]: Start isEmpty. Operand 3469 states and 4868 transitions. [2018-11-18 11:08:25,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 11:08:25,846 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:08:25,846 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:08:25,846 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:08:25,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:25,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1541340239, now seen corresponding path program 1 times [2018-11-18 11:08:25,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:08:25,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:25,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:25,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:25,851 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:08:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:25,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:25,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:08:25,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:08:25,919 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:08:25,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:08:25,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:08:25,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:08:25,920 INFO L87 Difference]: Start difference. First operand 3469 states and 4868 transitions. Second operand 3 states. [2018-11-18 11:08:26,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:26,192 INFO L93 Difference]: Finished difference Result 4694 states and 6647 transitions. [2018-11-18 11:08:26,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:08:26,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-11-18 11:08:26,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:08:26,200 INFO L225 Difference]: With dead ends: 4694 [2018-11-18 11:08:26,201 INFO L226 Difference]: Without dead ends: 4686 [2018-11-18 11:08:26,202 INFO L604 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 [2018-11-18 11:08:26,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4686 states. [2018-11-18 11:08:26,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4686 to 3500. [2018-11-18 11:08:26,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3500 states. [2018-11-18 11:08:26,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3500 states to 3500 states and 4905 transitions. [2018-11-18 11:08:26,448 INFO L78 Accepts]: Start accepts. Automaton has 3500 states and 4905 transitions. Word has length 83 [2018-11-18 11:08:26,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:08:26,448 INFO L480 AbstractCegarLoop]: Abstraction has 3500 states and 4905 transitions. [2018-11-18 11:08:26,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:08:26,449 INFO L276 IsEmpty]: Start isEmpty. Operand 3500 states and 4905 transitions. [2018-11-18 11:08:26,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-18 11:08:26,450 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:08:26,451 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:08:26,451 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:08:26,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:26,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1192132511, now seen corresponding path program 1 times [2018-11-18 11:08:26,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:08:26,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:26,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:26,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:26,456 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:08:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:26,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:26,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:08:26,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:08:26,538 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:08:26,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:08:26,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:08:26,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:08:26,539 INFO L87 Difference]: Start difference. First operand 3500 states and 4905 transitions. Second operand 3 states. [2018-11-18 11:08:26,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:26,793 INFO L93 Difference]: Finished difference Result 5907 states and 8404 transitions. [2018-11-18 11:08:26,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:08:26,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-11-18 11:08:26,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:08:26,803 INFO L225 Difference]: With dead ends: 5907 [2018-11-18 11:08:26,803 INFO L226 Difference]: Without dead ends: 3498 [2018-11-18 11:08:26,810 INFO L604 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 [2018-11-18 11:08:26,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3498 states. [2018-11-18 11:08:27,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3498 to 3498. [2018-11-18 11:08:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3498 states. [2018-11-18 11:08:27,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3498 states to 3498 states and 4901 transitions. [2018-11-18 11:08:27,015 INFO L78 Accepts]: Start accepts. Automaton has 3498 states and 4901 transitions. Word has length 89 [2018-11-18 11:08:27,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:08:27,015 INFO L480 AbstractCegarLoop]: Abstraction has 3498 states and 4901 transitions. [2018-11-18 11:08:27,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:08:27,015 INFO L276 IsEmpty]: Start isEmpty. Operand 3498 states and 4901 transitions. [2018-11-18 11:08:27,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 11:08:27,016 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:08:27,016 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:08:27,017 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:08:27,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:27,017 INFO L82 PathProgramCache]: Analyzing trace with hash -45096257, now seen corresponding path program 1 times [2018-11-18 11:08:27,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:08:27,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:27,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:27,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:27,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:08:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:27,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:27,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:08:27,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:08:27,108 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:08:27,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:08:27,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:08:27,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:08:27,109 INFO L87 Difference]: Start difference. First operand 3498 states and 4901 transitions. Second operand 6 states. [2018-11-18 11:08:27,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:27,307 INFO L93 Difference]: Finished difference Result 3629 states and 5057 transitions. [2018-11-18 11:08:27,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:08:27,308 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-11-18 11:08:27,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:08:27,314 INFO L225 Difference]: With dead ends: 3629 [2018-11-18 11:08:27,314 INFO L226 Difference]: Without dead ends: 3486 [2018-11-18 11:08:27,316 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:08:27,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3486 states. [2018-11-18 11:08:27,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3486 to 3486. [2018-11-18 11:08:27,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3486 states. [2018-11-18 11:08:27,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 4883 transitions. [2018-11-18 11:08:27,505 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 4883 transitions. Word has length 85 [2018-11-18 11:08:27,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:08:27,505 INFO L480 AbstractCegarLoop]: Abstraction has 3486 states and 4883 transitions. [2018-11-18 11:08:27,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:08:27,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 4883 transitions. [2018-11-18 11:08:27,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 11:08:27,507 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:08:27,507 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:08:27,507 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:08:27,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:27,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1762780528, now seen corresponding path program 1 times [2018-11-18 11:08:27,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:08:27,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:27,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:27,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:27,512 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:08:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:27,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:08:27,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:08:27,592 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:08:27,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:08:27,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:08:27,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:08:27,593 INFO L87 Difference]: Start difference. First operand 3486 states and 4883 transitions. Second operand 6 states. [2018-11-18 11:08:27,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:27,788 INFO L93 Difference]: Finished difference Result 3546 states and 4952 transitions. [2018-11-18 11:08:27,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:08:27,789 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-11-18 11:08:27,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:08:27,795 INFO L225 Difference]: With dead ends: 3546 [2018-11-18 11:08:27,795 INFO L226 Difference]: Without dead ends: 3486 [2018-11-18 11:08:27,797 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:08:27,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3486 states. [2018-11-18 11:08:27,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3486 to 3486. [2018-11-18 11:08:27,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3486 states. [2018-11-18 11:08:27,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 4882 transitions. [2018-11-18 11:08:27,975 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 4882 transitions. Word has length 83 [2018-11-18 11:08:27,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:08:27,975 INFO L480 AbstractCegarLoop]: Abstraction has 3486 states and 4882 transitions. [2018-11-18 11:08:27,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:08:27,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 4882 transitions. [2018-11-18 11:08:27,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 11:08:27,977 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:08:27,977 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:08:27,977 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:08:27,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:27,977 INFO L82 PathProgramCache]: Analyzing trace with hash 987845923, now seen corresponding path program 1 times [2018-11-18 11:08:27,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:08:27,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:27,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:27,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:27,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:08:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:28,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:28,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:08:28,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:08:28,058 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:08:28,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:08:28,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:08:28,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:08:28,058 INFO L87 Difference]: Start difference. First operand 3486 states and 4882 transitions. Second operand 5 states. [2018-11-18 11:08:34,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:34,569 INFO L93 Difference]: Finished difference Result 4678 states and 6619 transitions. [2018-11-18 11:08:34,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:08:34,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2018-11-18 11:08:34,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:08:34,578 INFO L225 Difference]: With dead ends: 4678 [2018-11-18 11:08:34,579 INFO L226 Difference]: Without dead ends: 4672 [2018-11-18 11:08:34,580 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:08:34,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4672 states. [2018-11-18 11:08:34,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4672 to 3486. [2018-11-18 11:08:34,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3486 states. [2018-11-18 11:08:34,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 4881 transitions. [2018-11-18 11:08:34,838 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 4881 transitions. Word has length 84 [2018-11-18 11:08:34,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:08:34,838 INFO L480 AbstractCegarLoop]: Abstraction has 3486 states and 4881 transitions. [2018-11-18 11:08:34,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:08:34,838 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 4881 transitions. [2018-11-18 11:08:34,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 11:08:34,839 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:08:34,839 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:08:34,840 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:08:34,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:34,840 INFO L82 PathProgramCache]: Analyzing trace with hash -555481540, now seen corresponding path program 1 times [2018-11-18 11:08:34,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:08:34,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:34,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:34,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:34,843 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:08:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:34,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:34,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:08:34,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 11:08:34,921 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:08:34,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 11:08:34,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 11:08:34,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 11:08:34,921 INFO L87 Difference]: Start difference. First operand 3486 states and 4881 transitions. Second operand 4 states. [2018-11-18 11:08:37,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:37,909 INFO L93 Difference]: Finished difference Result 4855 states and 6840 transitions. [2018-11-18 11:08:37,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:08:37,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-11-18 11:08:37,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:08:37,915 INFO L225 Difference]: With dead ends: 4855 [2018-11-18 11:08:37,915 INFO L226 Difference]: Without dead ends: 3449 [2018-11-18 11:08:37,918 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 11:08:37,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3449 states. [2018-11-18 11:08:38,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3449 to 3449. [2018-11-18 11:08:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3449 states. [2018-11-18 11:08:38,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 4825 transitions. [2018-11-18 11:08:38,103 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 4825 transitions. Word has length 85 [2018-11-18 11:08:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:08:38,103 INFO L480 AbstractCegarLoop]: Abstraction has 3449 states and 4825 transitions. [2018-11-18 11:08:38,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 11:08:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 4825 transitions. [2018-11-18 11:08:38,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 11:08:38,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:08:38,105 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:08:38,105 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:08:38,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:38,105 INFO L82 PathProgramCache]: Analyzing trace with hash -341044007, now seen corresponding path program 1 times [2018-11-18 11:08:38,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:08:38,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:38,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:38,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:38,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:08:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:38,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:38,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:08:38,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 11:08:38,199 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:08:38,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 11:08:38,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 11:08:38,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:08:38,200 INFO L87 Difference]: Start difference. First operand 3449 states and 4825 transitions. Second operand 9 states. [2018-11-18 11:08:52,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:52,537 INFO L93 Difference]: Finished difference Result 3470 states and 4849 transitions. [2018-11-18 11:08:52,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 11:08:52,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2018-11-18 11:08:52,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:08:52,542 INFO L225 Difference]: With dead ends: 3470 [2018-11-18 11:08:52,543 INFO L226 Difference]: Without dead ends: 3466 [2018-11-18 11:08:52,544 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:08:52,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3466 states. [2018-11-18 11:08:52,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3466 to 3462. [2018-11-18 11:08:52,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3462 states. [2018-11-18 11:08:52,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3462 states to 3462 states and 4841 transitions. [2018-11-18 11:08:52,736 INFO L78 Accepts]: Start accepts. Automaton has 3462 states and 4841 transitions. Word has length 85 [2018-11-18 11:08:52,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:08:52,736 INFO L480 AbstractCegarLoop]: Abstraction has 3462 states and 4841 transitions. [2018-11-18 11:08:52,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 11:08:52,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3462 states and 4841 transitions. [2018-11-18 11:08:52,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 11:08:52,737 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:08:52,737 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:08:52,737 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:08:52,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:52,738 INFO L82 PathProgramCache]: Analyzing trace with hash -341320837, now seen corresponding path program 1 times [2018-11-18 11:08:52,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:08:52,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:52,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:52,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:52,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:08:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:52,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:52,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:08:52,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:08:52,812 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:08:52,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:08:52,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:08:52,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:08:52,812 INFO L87 Difference]: Start difference. First operand 3462 states and 4841 transitions. Second operand 5 states. [2018-11-18 11:08:59,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:59,255 INFO L93 Difference]: Finished difference Result 4637 states and 6553 transitions. [2018-11-18 11:08:59,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:08:59,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2018-11-18 11:08:59,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:08:59,262 INFO L225 Difference]: With dead ends: 4637 [2018-11-18 11:08:59,262 INFO L226 Difference]: Without dead ends: 4605 [2018-11-18 11:08:59,264 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:08:59,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4605 states. [2018-11-18 11:08:59,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4605 to 3434. [2018-11-18 11:08:59,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3434 states. [2018-11-18 11:08:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3434 states to 3434 states and 4806 transitions. [2018-11-18 11:08:59,472 INFO L78 Accepts]: Start accepts. Automaton has 3434 states and 4806 transitions. Word has length 85 [2018-11-18 11:08:59,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:08:59,473 INFO L480 AbstractCegarLoop]: Abstraction has 3434 states and 4806 transitions. [2018-11-18 11:08:59,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:08:59,473 INFO L276 IsEmpty]: Start isEmpty. Operand 3434 states and 4806 transitions. [2018-11-18 11:08:59,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 11:08:59,474 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:08:59,474 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:08:59,474 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:08:59,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:59,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1172725742, now seen corresponding path program 1 times [2018-11-18 11:08:59,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:08:59,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:59,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:59,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:59,477 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:08:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:59,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:59,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:08:59,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:08:59,549 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:08:59,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:08:59,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:08:59,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:08:59,550 INFO L87 Difference]: Start difference. First operand 3434 states and 4806 transitions. Second operand 6 states. [2018-11-18 11:08:59,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:59,767 INFO L93 Difference]: Finished difference Result 3492 states and 4871 transitions. [2018-11-18 11:08:59,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:08:59,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-11-18 11:08:59,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:08:59,773 INFO L225 Difference]: With dead ends: 3492 [2018-11-18 11:08:59,774 INFO L226 Difference]: Without dead ends: 3440 [2018-11-18 11:08:59,775 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:08:59,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3440 states. [2018-11-18 11:08:59,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3440 to 3434. [2018-11-18 11:08:59,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3434 states. [2018-11-18 11:08:59,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3434 states to 3434 states and 4804 transitions. [2018-11-18 11:08:59,967 INFO L78 Accepts]: Start accepts. Automaton has 3434 states and 4804 transitions. Word has length 85 [2018-11-18 11:08:59,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:08:59,967 INFO L480 AbstractCegarLoop]: Abstraction has 3434 states and 4804 transitions. [2018-11-18 11:08:59,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:08:59,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3434 states and 4804 transitions. [2018-11-18 11:08:59,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-18 11:08:59,968 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:08:59,969 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:08:59,969 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:08:59,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:59,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1213810241, now seen corresponding path program 1 times [2018-11-18 11:08:59,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:08:59,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:59,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:59,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:59,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:08:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:09:00,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:09:00,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:09:00,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:09:00,022 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:09:00,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:09:00,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:09:00,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:09:00,022 INFO L87 Difference]: Start difference. First operand 3434 states and 4804 transitions. Second operand 3 states. [2018-11-18 11:09:02,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:09:02,336 INFO L93 Difference]: Finished difference Result 4594 states and 6500 transitions. [2018-11-18 11:09:02,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:09:02,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-11-18 11:09:02,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:09:02,344 INFO L225 Difference]: With dead ends: 4594 [2018-11-18 11:09:02,344 INFO L226 Difference]: Without dead ends: 4591 [2018-11-18 11:09:02,346 INFO L604 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 [2018-11-18 11:09:02,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4591 states. [2018-11-18 11:09:02,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4591 to 3438. [2018-11-18 11:09:02,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3438 states. [2018-11-18 11:09:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 4810 transitions. [2018-11-18 11:09:02,595 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 4810 transitions. Word has length 91 [2018-11-18 11:09:02,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:09:02,595 INFO L480 AbstractCegarLoop]: Abstraction has 3438 states and 4810 transitions. [2018-11-18 11:09:02,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:09:02,595 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 4810 transitions. [2018-11-18 11:09:02,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-18 11:09:02,596 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:09:02,596 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:09:02,597 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:09:02,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:09:02,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1265268572, now seen corresponding path program 1 times [2018-11-18 11:09:02,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:09:02,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:09:02,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:09:02,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:09:02,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:09:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:09:02,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:09:02,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:09:02,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:09:02,686 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:09:02,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:09:02,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:09:02,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:09:02,687 INFO L87 Difference]: Start difference. First operand 3438 states and 4810 transitions. Second operand 5 states. [2018-11-18 11:09:10,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:09:10,367 INFO L93 Difference]: Finished difference Result 8128 states and 11645 transitions. [2018-11-18 11:09:10,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:09:10,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-11-18 11:09:10,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:09:10,379 INFO L225 Difference]: With dead ends: 8128 [2018-11-18 11:09:10,380 INFO L226 Difference]: Without dead ends: 5758 [2018-11-18 11:09:10,386 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:09:10,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5758 states. [2018-11-18 11:09:10,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5758 to 3452. [2018-11-18 11:09:10,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3452 states. [2018-11-18 11:09:10,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 4827 transitions. [2018-11-18 11:09:10,691 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 4827 transitions. Word has length 92 [2018-11-18 11:09:10,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:09:10,692 INFO L480 AbstractCegarLoop]: Abstraction has 3452 states and 4827 transitions. [2018-11-18 11:09:10,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:09:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 4827 transitions. [2018-11-18 11:09:10,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-18 11:09:10,694 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:09:10,694 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:09:10,694 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:09:10,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:09:10,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1960604776, now seen corresponding path program 1 times [2018-11-18 11:09:10,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:09:10,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:09:10,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:09:10,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:09:10,700 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:09:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:09:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:09:10,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:09:10,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 11:09:10,850 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:09:10,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 11:09:10,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 11:09:10,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:09:10,850 INFO L87 Difference]: Start difference. First operand 3452 states and 4827 transitions. Second operand 14 states. [2018-11-18 11:09:35,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:09:35,486 INFO L93 Difference]: Finished difference Result 3469 states and 4845 transitions. [2018-11-18 11:09:35,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 11:09:35,487 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 101 [2018-11-18 11:09:35,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:09:35,493 INFO L225 Difference]: With dead ends: 3469 [2018-11-18 11:09:35,493 INFO L226 Difference]: Without dead ends: 3443 [2018-11-18 11:09:35,495 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-18 11:09:35,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3443 states. [2018-11-18 11:09:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3443 to 3443. [2018-11-18 11:09:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3443 states. [2018-11-18 11:09:35,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 4815 transitions. [2018-11-18 11:09:35,747 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 4815 transitions. Word has length 101 [2018-11-18 11:09:35,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:09:35,747 INFO L480 AbstractCegarLoop]: Abstraction has 3443 states and 4815 transitions. [2018-11-18 11:09:35,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 11:09:35,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 4815 transitions. [2018-11-18 11:09:35,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-18 11:09:35,749 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:09:35,749 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:09:35,749 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:09:35,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:09:35,749 INFO L82 PathProgramCache]: Analyzing trace with hash 291954643, now seen corresponding path program 1 times [2018-11-18 11:09:35,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:09:35,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:09:35,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:09:35,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:09:35,754 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:09:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:09:35,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:09:35,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:09:35,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 11:09:35,918 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:09:35,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 11:09:35,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 11:09:35,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:09:35,919 INFO L87 Difference]: Start difference. First operand 3443 states and 4815 transitions. Second operand 14 states. [2018-11-18 11:10:00,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:10:00,526 INFO L93 Difference]: Finished difference Result 3460 states and 4833 transitions. [2018-11-18 11:10:00,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 11:10:00,527 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 97 [2018-11-18 11:10:00,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:10:00,531 INFO L225 Difference]: With dead ends: 3460 [2018-11-18 11:10:00,532 INFO L226 Difference]: Without dead ends: 3436 [2018-11-18 11:10:00,532 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-18 11:10:00,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3436 states. [2018-11-18 11:10:00,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3436 to 3436. [2018-11-18 11:10:00,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3436 states. [2018-11-18 11:10:00,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 4806 transitions. [2018-11-18 11:10:00,769 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 4806 transitions. Word has length 97 [2018-11-18 11:10:00,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:10:00,769 INFO L480 AbstractCegarLoop]: Abstraction has 3436 states and 4806 transitions. [2018-11-18 11:10:00,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 11:10:00,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 4806 transitions. [2018-11-18 11:10:00,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-18 11:10:00,771 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:10:00,771 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:10:00,771 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:10:00,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:10:00,771 INFO L82 PathProgramCache]: Analyzing trace with hash 726840922, now seen corresponding path program 1 times [2018-11-18 11:10:00,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:10:00,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:10:00,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:10:00,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:10:00,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:10:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:10:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:10:00,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:10:00,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 11:10:00,925 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:10:00,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 11:10:00,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 11:10:00,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:10:00,925 INFO L87 Difference]: Start difference. First operand 3436 states and 4806 transitions. Second operand 14 states. [2018-11-18 11:10:25,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:10:25,500 INFO L93 Difference]: Finished difference Result 3453 states and 4824 transitions. [2018-11-18 11:10:25,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 11:10:25,501 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 90 [2018-11-18 11:10:25,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:10:25,506 INFO L225 Difference]: With dead ends: 3453 [2018-11-18 11:10:25,506 INFO L226 Difference]: Without dead ends: 3434 [2018-11-18 11:10:25,508 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-18 11:10:25,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2018-11-18 11:10:25,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 3434. [2018-11-18 11:10:25,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3434 states. [2018-11-18 11:10:25,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3434 states to 3434 states and 4802 transitions. [2018-11-18 11:10:25,742 INFO L78 Accepts]: Start accepts. Automaton has 3434 states and 4802 transitions. Word has length 90 [2018-11-18 11:10:25,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:10:25,742 INFO L480 AbstractCegarLoop]: Abstraction has 3434 states and 4802 transitions. [2018-11-18 11:10:25,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 11:10:25,743 INFO L276 IsEmpty]: Start isEmpty. Operand 3434 states and 4802 transitions. [2018-11-18 11:10:25,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-18 11:10:25,744 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:10:25,744 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:10:25,744 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:10:25,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:10:25,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1719818827, now seen corresponding path program 1 times [2018-11-18 11:10:25,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:10:25,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:10:25,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:10:25,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:10:25,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:10:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:10:25,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:10:25,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:10:25,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:10:25,819 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:10:25,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:10:25,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:10:25,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:10:25,820 INFO L87 Difference]: Start difference. First operand 3434 states and 4802 transitions. Second operand 6 states. [2018-11-18 11:10:26,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:10:26,087 INFO L93 Difference]: Finished difference Result 3495 states and 4870 transitions. [2018-11-18 11:10:26,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:10:26,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-11-18 11:10:26,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:10:26,093 INFO L225 Difference]: With dead ends: 3495 [2018-11-18 11:10:26,093 INFO L226 Difference]: Without dead ends: 3422 [2018-11-18 11:10:26,095 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:10:26,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3422 states. [2018-11-18 11:10:26,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3422 to 3412. [2018-11-18 11:10:26,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3412 states. [2018-11-18 11:10:26,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3412 states to 3412 states and 4768 transitions. [2018-11-18 11:10:26,369 INFO L78 Accepts]: Start accepts. Automaton has 3412 states and 4768 transitions. Word has length 89 [2018-11-18 11:10:26,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:10:26,369 INFO L480 AbstractCegarLoop]: Abstraction has 3412 states and 4768 transitions. [2018-11-18 11:10:26,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:10:26,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3412 states and 4768 transitions. [2018-11-18 11:10:26,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-18 11:10:26,370 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:10:26,371 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:10:26,371 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:10:26,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:10:26,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1020773787, now seen corresponding path program 1 times [2018-11-18 11:10:26,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:10:26,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:10:26,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:10:26,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:10:26,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:10:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:10:26,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:10:26,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:10:26,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 11:10:26,539 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:10:26,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 11:10:26,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 11:10:26,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:10:26,540 INFO L87 Difference]: Start difference. First operand 3412 states and 4768 transitions. Second operand 14 states. [2018-11-18 11:10:51,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:10:51,081 INFO L93 Difference]: Finished difference Result 3429 states and 4786 transitions. [2018-11-18 11:10:51,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 11:10:51,081 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 97 [2018-11-18 11:10:51,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:10:51,086 INFO L225 Difference]: With dead ends: 3429 [2018-11-18 11:10:51,087 INFO L226 Difference]: Without dead ends: 3362 [2018-11-18 11:10:51,088 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-18 11:10:51,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3362 states. [2018-11-18 11:10:51,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3362 to 3362. [2018-11-18 11:10:51,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3362 states. [2018-11-18 11:10:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3362 states to 3362 states and 4699 transitions. [2018-11-18 11:10:51,330 INFO L78 Accepts]: Start accepts. Automaton has 3362 states and 4699 transitions. Word has length 97 [2018-11-18 11:10:51,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:10:51,330 INFO L480 AbstractCegarLoop]: Abstraction has 3362 states and 4699 transitions. [2018-11-18 11:10:51,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 11:10:51,331 INFO L276 IsEmpty]: Start isEmpty. Operand 3362 states and 4699 transitions. [2018-11-18 11:10:51,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-18 11:10:51,331 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:10:51,332 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:10:51,332 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:10:51,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:10:51,332 INFO L82 PathProgramCache]: Analyzing trace with hash 965438144, now seen corresponding path program 1 times [2018-11-18 11:10:51,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:10:51,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:10:51,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:10:51,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:10:51,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:10:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:10:51,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:10:51,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:10:51,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 11:10:51,497 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:10:51,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 11:10:51,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 11:10:51,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:10:51,497 INFO L87 Difference]: Start difference. First operand 3362 states and 4699 transitions. Second operand 14 states. [2018-11-18 11:11:16,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:11:16,031 INFO L93 Difference]: Finished difference Result 3379 states and 4717 transitions. [2018-11-18 11:11:16,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 11:11:16,031 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 91 [2018-11-18 11:11:16,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:11:16,036 INFO L225 Difference]: With dead ends: 3379 [2018-11-18 11:11:16,037 INFO L226 Difference]: Without dead ends: 3355 [2018-11-18 11:11:16,038 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-18 11:11:16,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2018-11-18 11:11:16,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 3355. [2018-11-18 11:11:16,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3355 states. [2018-11-18 11:11:16,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3355 states to 3355 states and 4690 transitions. [2018-11-18 11:11:16,280 INFO L78 Accepts]: Start accepts. Automaton has 3355 states and 4690 transitions. Word has length 91 [2018-11-18 11:11:16,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:11:16,281 INFO L480 AbstractCegarLoop]: Abstraction has 3355 states and 4690 transitions. [2018-11-18 11:11:16,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 11:11:16,281 INFO L276 IsEmpty]: Start isEmpty. Operand 3355 states and 4690 transitions. [2018-11-18 11:11:16,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-18 11:11:16,282 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:11:16,282 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:11:16,282 INFO L423 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:11:16,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:11:16,282 INFO L82 PathProgramCache]: Analyzing trace with hash 11061657, now seen corresponding path program 1 times [2018-11-18 11:11:16,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:11:16,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:16,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:11:16,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:16,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:11:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:11:16,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:11:16,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:11:16,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 11:11:16,374 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:11:16,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 11:11:16,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 11:11:16,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:11:16,375 INFO L87 Difference]: Start difference. First operand 3355 states and 4690 transitions. Second operand 9 states. [2018-11-18 11:11:16,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:11:16,667 INFO L93 Difference]: Finished difference Result 3423 states and 4766 transitions. [2018-11-18 11:11:16,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 11:11:16,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2018-11-18 11:11:16,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:11:16,673 INFO L225 Difference]: With dead ends: 3423 [2018-11-18 11:11:16,673 INFO L226 Difference]: Without dead ends: 3361 [2018-11-18 11:11:16,675 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:11:16,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3361 states. [2018-11-18 11:11:16,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3361 to 3355. [2018-11-18 11:11:16,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3355 states. [2018-11-18 11:11:16,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3355 states to 3355 states and 4689 transitions. [2018-11-18 11:11:16,912 INFO L78 Accepts]: Start accepts. Automaton has 3355 states and 4689 transitions. Word has length 91 [2018-11-18 11:11:16,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:11:16,912 INFO L480 AbstractCegarLoop]: Abstraction has 3355 states and 4689 transitions. [2018-11-18 11:11:16,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 11:11:16,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3355 states and 4689 transitions. [2018-11-18 11:11:16,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 11:11:16,913 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:11:16,913 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:11:16,913 INFO L423 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:11:16,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:11:16,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1806457275, now seen corresponding path program 1 times [2018-11-18 11:11:16,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:11:16,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:16,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:11:16,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:16,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:11:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:11:17,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:11:17,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:11:17,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 11:11:17,009 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:11:17,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 11:11:17,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 11:11:17,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:11:17,009 INFO L87 Difference]: Start difference. First operand 3355 states and 4689 transitions. Second operand 9 states. [2018-11-18 11:11:17,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:11:17,311 INFO L93 Difference]: Finished difference Result 3374 states and 4709 transitions. [2018-11-18 11:11:17,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 11:11:17,311 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-11-18 11:11:17,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:11:17,316 INFO L225 Difference]: With dead ends: 3374 [2018-11-18 11:11:17,316 INFO L226 Difference]: Without dead ends: 3328 [2018-11-18 11:11:17,318 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:11:17,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3328 states. [2018-11-18 11:11:17,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3328 to 3328. [2018-11-18 11:11:17,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3328 states. [2018-11-18 11:11:17,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3328 states to 3328 states and 4661 transitions. [2018-11-18 11:11:17,550 INFO L78 Accepts]: Start accepts. Automaton has 3328 states and 4661 transitions. Word has length 94 [2018-11-18 11:11:17,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:11:17,550 INFO L480 AbstractCegarLoop]: Abstraction has 3328 states and 4661 transitions. [2018-11-18 11:11:17,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 11:11:17,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3328 states and 4661 transitions. [2018-11-18 11:11:17,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-18 11:11:17,551 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:11:17,551 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:11:17,551 INFO L423 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:11:17,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:11:17,551 INFO L82 PathProgramCache]: Analyzing trace with hash 556045968, now seen corresponding path program 1 times [2018-11-18 11:11:17,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:11:17,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:17,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:11:17,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:17,554 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:11:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:11:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:11:17,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:11:17,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:11:17,606 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:11:17,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:11:17,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:11:17,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:11:17,606 INFO L87 Difference]: Start difference. First operand 3328 states and 4661 transitions. Second operand 3 states. [2018-11-18 11:11:17,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:11:17,835 INFO L93 Difference]: Finished difference Result 5723 states and 8136 transitions. [2018-11-18 11:11:17,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:11:17,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-11-18 11:11:17,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:11:17,841 INFO L225 Difference]: With dead ends: 5723 [2018-11-18 11:11:17,841 INFO L226 Difference]: Without dead ends: 3344 [2018-11-18 11:11:17,845 INFO L604 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 [2018-11-18 11:11:17,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3344 states. [2018-11-18 11:11:18,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3344 to 3331. [2018-11-18 11:11:18,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3331 states. [2018-11-18 11:11:18,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 4665 transitions. [2018-11-18 11:11:18,099 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 4665 transitions. Word has length 98 [2018-11-18 11:11:18,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:11:18,099 INFO L480 AbstractCegarLoop]: Abstraction has 3331 states and 4665 transitions. [2018-11-18 11:11:18,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:11:18,099 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 4665 transitions. [2018-11-18 11:11:18,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-18 11:11:18,100 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:11:18,101 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:11:18,101 INFO L423 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:11:18,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:11:18,101 INFO L82 PathProgramCache]: Analyzing trace with hash -986512087, now seen corresponding path program 1 times [2018-11-18 11:11:18,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:11:18,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:18,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:11:18,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:18,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:11:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:11:18,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:11:18,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:11:18,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:11:18,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:11:18,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:11:18,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:11:18,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:11:18,183 INFO L87 Difference]: Start difference. First operand 3331 states and 4665 transitions. Second operand 5 states. [2018-11-18 11:11:24,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:11:24,297 INFO L93 Difference]: Finished difference Result 4558 states and 6427 transitions. [2018-11-18 11:11:24,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:11:24,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-11-18 11:11:24,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:11:24,304 INFO L225 Difference]: With dead ends: 4558 [2018-11-18 11:11:24,304 INFO L226 Difference]: Without dead ends: 3340 [2018-11-18 11:11:24,307 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:11:24,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3340 states. [2018-11-18 11:11:24,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3340 to 3328. [2018-11-18 11:11:24,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3328 states. [2018-11-18 11:11:24,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3328 states to 3328 states and 4658 transitions. [2018-11-18 11:11:24,544 INFO L78 Accepts]: Start accepts. Automaton has 3328 states and 4658 transitions. Word has length 99 [2018-11-18 11:11:24,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:11:24,544 INFO L480 AbstractCegarLoop]: Abstraction has 3328 states and 4658 transitions. [2018-11-18 11:11:24,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:11:24,544 INFO L276 IsEmpty]: Start isEmpty. Operand 3328 states and 4658 transitions. [2018-11-18 11:11:24,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-18 11:11:24,545 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:11:24,545 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:11:24,545 INFO L423 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:11:24,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:11:24,546 INFO L82 PathProgramCache]: Analyzing trace with hash 494516285, now seen corresponding path program 1 times [2018-11-18 11:11:24,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:11:24,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:24,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:11:24,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:24,548 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:11:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:11:24,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:11:24,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:11:24,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:11:24,595 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:11:24,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:11:24,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:11:24,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:11:24,595 INFO L87 Difference]: Start difference. First operand 3328 states and 4658 transitions. Second operand 3 states. [2018-11-18 11:11:24,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:11:24,829 INFO L93 Difference]: Finished difference Result 5723 states and 8133 transitions. [2018-11-18 11:11:24,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:11:24,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-11-18 11:11:24,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:11:24,835 INFO L225 Difference]: With dead ends: 5723 [2018-11-18 11:11:24,835 INFO L226 Difference]: Without dead ends: 3344 [2018-11-18 11:11:24,839 INFO L604 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 [2018-11-18 11:11:24,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3344 states. [2018-11-18 11:11:25,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3344 to 3328. [2018-11-18 11:11:25,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3328 states. [2018-11-18 11:11:25,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3328 states to 3328 states and 4658 transitions. [2018-11-18 11:11:25,073 INFO L78 Accepts]: Start accepts. Automaton has 3328 states and 4658 transitions. Word has length 99 [2018-11-18 11:11:25,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:11:25,073 INFO L480 AbstractCegarLoop]: Abstraction has 3328 states and 4658 transitions. [2018-11-18 11:11:25,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:11:25,073 INFO L276 IsEmpty]: Start isEmpty. Operand 3328 states and 4658 transitions. [2018-11-18 11:11:25,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-18 11:11:25,074 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:11:25,074 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:11:25,074 INFO L423 AbstractCegarLoop]: === Iteration 69 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:11:25,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:11:25,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1086919629, now seen corresponding path program 1 times [2018-11-18 11:11:25,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:11:25,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:25,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:11:25,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:25,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:11:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:11:25,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 11:11:25,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:11:25,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 11:11:25,150 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:11:25,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 11:11:25,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 11:11:25,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:11:25,151 INFO L87 Difference]: Start difference. First operand 3328 states and 4658 transitions. Second operand 8 states. [2018-11-18 11:11:25,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:11:25,442 INFO L93 Difference]: Finished difference Result 3386 states and 4724 transitions. [2018-11-18 11:11:25,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 11:11:25,443 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-11-18 11:11:25,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:11:25,448 INFO L225 Difference]: With dead ends: 3386 [2018-11-18 11:11:25,448 INFO L226 Difference]: Without dead ends: 3326 [2018-11-18 11:11:25,449 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:11:25,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2018-11-18 11:11:25,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 3326. [2018-11-18 11:11:25,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3326 states. [2018-11-18 11:11:25,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3326 states to 3326 states and 4654 transitions. [2018-11-18 11:11:25,696 INFO L78 Accepts]: Start accepts. Automaton has 3326 states and 4654 transitions. Word has length 96 [2018-11-18 11:11:25,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:11:25,696 INFO L480 AbstractCegarLoop]: Abstraction has 3326 states and 4654 transitions. [2018-11-18 11:11:25,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 11:11:25,696 INFO L276 IsEmpty]: Start isEmpty. Operand 3326 states and 4654 transitions. [2018-11-18 11:11:25,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-18 11:11:25,697 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:11:25,697 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:11:25,697 INFO L423 AbstractCegarLoop]: === Iteration 70 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:11:25,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:11:25,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2114899971, now seen corresponding path program 1 times [2018-11-18 11:11:25,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:11:25,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:25,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:11:25,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:25,701 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:11:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:11:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:11:25,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:11:25,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:11:25,775 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:11:25,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:11:25,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:11:25,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:11:25,775 INFO L87 Difference]: Start difference. First operand 3326 states and 4654 transitions. Second operand 3 states. [2018-11-18 11:11:28,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:11:28,106 INFO L93 Difference]: Finished difference Result 6906 states and 9843 transitions. [2018-11-18 11:11:28,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:11:28,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-11-18 11:11:28,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:11:28,114 INFO L225 Difference]: With dead ends: 6906 [2018-11-18 11:11:28,114 INFO L226 Difference]: Without dead ends: 4537 [2018-11-18 11:11:28,118 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:11:28,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4537 states. [2018-11-18 11:11:28,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4537 to 4478. [2018-11-18 11:11:28,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4478 states. [2018-11-18 11:11:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4478 states to 4478 states and 6335 transitions. [2018-11-18 11:11:28,447 INFO L78 Accepts]: Start accepts. Automaton has 4478 states and 6335 transitions. Word has length 99 [2018-11-18 11:11:28,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:11:28,447 INFO L480 AbstractCegarLoop]: Abstraction has 4478 states and 6335 transitions. [2018-11-18 11:11:28,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:11:28,447 INFO L276 IsEmpty]: Start isEmpty. Operand 4478 states and 6335 transitions. [2018-11-18 11:11:28,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 11:11:28,448 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:11:28,448 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:11:28,448 INFO L423 AbstractCegarLoop]: === Iteration 71 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:11:28,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:11:28,448 INFO L82 PathProgramCache]: Analyzing trace with hash -805949351, now seen corresponding path program 1 times [2018-11-18 11:11:28,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:11:28,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:28,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:11:28,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:28,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:11:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:11:28,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:11:28,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:11:28,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 11:11:28,593 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:11:28,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 11:11:28,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 11:11:28,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:11:28,594 INFO L87 Difference]: Start difference. First operand 4478 states and 6335 transitions. Second operand 14 states. [2018-11-18 11:11:53,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:11:53,186 INFO L93 Difference]: Finished difference Result 4495 states and 6353 transitions. [2018-11-18 11:11:53,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 11:11:53,187 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 107 [2018-11-18 11:11:53,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:11:53,194 INFO L225 Difference]: With dead ends: 4495 [2018-11-18 11:11:53,194 INFO L226 Difference]: Without dead ends: 4469 [2018-11-18 11:11:53,196 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-18 11:11:53,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4469 states. [2018-11-18 11:11:53,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4469 to 4469. [2018-11-18 11:11:53,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4469 states. [2018-11-18 11:11:53,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4469 states to 4469 states and 6323 transitions. [2018-11-18 11:11:53,514 INFO L78 Accepts]: Start accepts. Automaton has 4469 states and 6323 transitions. Word has length 107 [2018-11-18 11:11:53,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:11:53,515 INFO L480 AbstractCegarLoop]: Abstraction has 4469 states and 6323 transitions. [2018-11-18 11:11:53,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 11:11:53,515 INFO L276 IsEmpty]: Start isEmpty. Operand 4469 states and 6323 transitions. [2018-11-18 11:11:53,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-18 11:11:53,516 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:11:53,516 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:11:53,516 INFO L423 AbstractCegarLoop]: === Iteration 72 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:11:53,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:11:53,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1788454898, now seen corresponding path program 1 times [2018-11-18 11:11:53,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:11:53,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:53,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:11:53,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:11:53,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:11:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:11:53,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:11:53,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:11:53,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 11:11:53,657 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:11:53,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 11:11:53,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 11:11:53,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:11:53,657 INFO L87 Difference]: Start difference. First operand 4469 states and 6323 transitions. Second operand 14 states. [2018-11-18 11:12:18,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:12:18,262 INFO L93 Difference]: Finished difference Result 4486 states and 6341 transitions. [2018-11-18 11:12:18,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 11:12:18,262 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2018-11-18 11:12:18,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:12:18,269 INFO L225 Difference]: With dead ends: 4486 [2018-11-18 11:12:18,270 INFO L226 Difference]: Without dead ends: 4462 [2018-11-18 11:12:18,271 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-18 11:12:18,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4462 states. [2018-11-18 11:12:18,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4462 to 4462. [2018-11-18 11:12:18,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4462 states. [2018-11-18 11:12:18,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4462 states to 4462 states and 6314 transitions. [2018-11-18 11:12:18,594 INFO L78 Accepts]: Start accepts. Automaton has 4462 states and 6314 transitions. Word has length 98 [2018-11-18 11:12:18,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:12:18,594 INFO L480 AbstractCegarLoop]: Abstraction has 4462 states and 6314 transitions. [2018-11-18 11:12:18,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 11:12:18,594 INFO L276 IsEmpty]: Start isEmpty. Operand 4462 states and 6314 transitions. [2018-11-18 11:12:18,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-18 11:12:18,595 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:12:18,595 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:12:18,596 INFO L423 AbstractCegarLoop]: === Iteration 73 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:12:18,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:18,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2024807762, now seen corresponding path program 1 times [2018-11-18 11:12:18,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:12:18,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:18,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:18,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:18,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:12:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:18,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:12:18,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:12:18,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 11:12:18,737 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:12:18,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 11:12:18,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 11:12:18,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:12:18,738 INFO L87 Difference]: Start difference. First operand 4462 states and 6314 transitions. Second operand 14 states. [2018-11-18 11:12:43,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:12:43,324 INFO L93 Difference]: Finished difference Result 4479 states and 6332 transitions. [2018-11-18 11:12:43,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 11:12:43,325 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2018-11-18 11:12:43,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:12:43,331 INFO L225 Difference]: With dead ends: 4479 [2018-11-18 11:12:43,332 INFO L226 Difference]: Without dead ends: 4453 [2018-11-18 11:12:43,333 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-18 11:12:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4453 states. [2018-11-18 11:12:43,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4453 to 4453. [2018-11-18 11:12:43,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4453 states. [2018-11-18 11:12:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4453 states to 4453 states and 6302 transitions. [2018-11-18 11:12:43,657 INFO L78 Accepts]: Start accepts. Automaton has 4453 states and 6302 transitions. Word has length 98 [2018-11-18 11:12:43,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:12:43,657 INFO L480 AbstractCegarLoop]: Abstraction has 4453 states and 6302 transitions. [2018-11-18 11:12:43,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 11:12:43,657 INFO L276 IsEmpty]: Start isEmpty. Operand 4453 states and 6302 transitions. [2018-11-18 11:12:43,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-18 11:12:43,658 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:12:43,658 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:12:43,658 INFO L423 AbstractCegarLoop]: === Iteration 74 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:12:43,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:43,658 INFO L82 PathProgramCache]: Analyzing trace with hash 384798141, now seen corresponding path program 1 times [2018-11-18 11:12:43,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:12:43,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:43,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:43,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:43,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:12:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 11:12:43,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:12:43,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 11:12:43,743 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:12:43,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 11:12:43,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 11:12:43,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:12:43,743 INFO L87 Difference]: Start difference. First operand 4453 states and 6302 transitions. Second operand 8 states. [2018-11-18 11:12:44,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:12:44,117 INFO L93 Difference]: Finished difference Result 4511 states and 6368 transitions. [2018-11-18 11:12:44,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 11:12:44,117 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2018-11-18 11:12:44,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:12:44,124 INFO L225 Difference]: With dead ends: 4511 [2018-11-18 11:12:44,124 INFO L226 Difference]: Without dead ends: 4451 [2018-11-18 11:12:44,125 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:12:44,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4451 states. [2018-11-18 11:12:44,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4451 to 4451. [2018-11-18 11:12:44,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4451 states. [2018-11-18 11:12:44,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4451 states to 4451 states and 6298 transitions. [2018-11-18 11:12:44,469 INFO L78 Accepts]: Start accepts. Automaton has 4451 states and 6298 transitions. Word has length 97 [2018-11-18 11:12:44,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:12:44,469 INFO L480 AbstractCegarLoop]: Abstraction has 4451 states and 6298 transitions. [2018-11-18 11:12:44,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 11:12:44,469 INFO L276 IsEmpty]: Start isEmpty. Operand 4451 states and 6298 transitions. [2018-11-18 11:12:44,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-18 11:12:44,470 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:12:44,470 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:12:44,470 INFO L423 AbstractCegarLoop]: === Iteration 75 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:12:44,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:44,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1921744839, now seen corresponding path program 1 times [2018-11-18 11:12:44,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:12:44,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:44,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:44,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:44,473 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:12:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:12:44,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:12:44,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-18 11:12:44,620 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:12:44,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 11:12:44,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 11:12:44,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-18 11:12:44,621 INFO L87 Difference]: Start difference. First operand 4451 states and 6298 transitions. Second operand 15 states. [2018-11-18 11:13:11,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:13:11,357 INFO L93 Difference]: Finished difference Result 4468 states and 6316 transitions. [2018-11-18 11:13:11,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 11:13:11,357 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2018-11-18 11:13:11,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:13:11,365 INFO L225 Difference]: With dead ends: 4468 [2018-11-18 11:13:11,366 INFO L226 Difference]: Without dead ends: 4426 [2018-11-18 11:13:11,368 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-11-18 11:13:11,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4426 states. [2018-11-18 11:13:11,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4426 to 4426. [2018-11-18 11:13:11,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4426 states. [2018-11-18 11:13:11,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4426 states to 4426 states and 6271 transitions. [2018-11-18 11:13:11,766 INFO L78 Accepts]: Start accepts. Automaton has 4426 states and 6271 transitions. Word has length 97 [2018-11-18 11:13:11,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:13:11,766 INFO L480 AbstractCegarLoop]: Abstraction has 4426 states and 6271 transitions. [2018-11-18 11:13:11,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 11:13:11,766 INFO L276 IsEmpty]: Start isEmpty. Operand 4426 states and 6271 transitions. [2018-11-18 11:13:11,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-18 11:13:11,767 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:13:11,767 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:13:11,767 INFO L423 AbstractCegarLoop]: === Iteration 76 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:13:11,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:13:11,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1262122948, now seen corresponding path program 1 times [2018-11-18 11:13:11,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:13:11,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:13:11,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:13:11,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:13:11,773 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:13:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:13:11,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:13:11,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:13:11,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 11:13:11,889 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:13:11,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 11:13:11,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 11:13:11,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:13:11,890 INFO L87 Difference]: Start difference. First operand 4426 states and 6271 transitions. Second operand 9 states. [2018-11-18 11:13:26,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:13:26,416 INFO L93 Difference]: Finished difference Result 4432 states and 6276 transitions. [2018-11-18 11:13:26,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 11:13:26,417 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-11-18 11:13:26,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:13:26,426 INFO L225 Difference]: With dead ends: 4432 [2018-11-18 11:13:26,426 INFO L226 Difference]: Without dead ends: 4279 [2018-11-18 11:13:26,429 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:13:26,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4279 states. [2018-11-18 11:13:26,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4279 to 4279. [2018-11-18 11:13:26,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4279 states. [2018-11-18 11:13:26,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4279 states to 4279 states and 6086 transitions. [2018-11-18 11:13:26,818 INFO L78 Accepts]: Start accepts. Automaton has 4279 states and 6086 transitions. Word has length 98 [2018-11-18 11:13:26,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:13:26,818 INFO L480 AbstractCegarLoop]: Abstraction has 4279 states and 6086 transitions. [2018-11-18 11:13:26,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 11:13:26,818 INFO L276 IsEmpty]: Start isEmpty. Operand 4279 states and 6086 transitions. [2018-11-18 11:13:26,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 11:13:26,820 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:13:26,820 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:13:26,820 INFO L423 AbstractCegarLoop]: === Iteration 77 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:13:26,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:13:26,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1235973438, now seen corresponding path program 1 times [2018-11-18 11:13:26,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:13:26,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:13:26,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:13:26,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:13:26,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:13:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:13:26,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 11:13:26,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:13:26,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 11:13:26,968 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:13:26,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 11:13:26,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 11:13:26,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:13:26,968 INFO L87 Difference]: Start difference. First operand 4279 states and 6086 transitions. Second operand 8 states. [2018-11-18 11:13:27,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:13:27,377 INFO L93 Difference]: Finished difference Result 4337 states and 6152 transitions. [2018-11-18 11:13:27,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 11:13:27,378 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2018-11-18 11:13:27,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:13:27,386 INFO L225 Difference]: With dead ends: 4337 [2018-11-18 11:13:27,386 INFO L226 Difference]: Without dead ends: 4276 [2018-11-18 11:13:27,388 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-18 11:13:27,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2018-11-18 11:13:27,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4276. [2018-11-18 11:13:27,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4276 states. [2018-11-18 11:13:27,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 6081 transitions. [2018-11-18 11:13:27,779 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 6081 transitions. Word has length 102 [2018-11-18 11:13:27,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:13:27,779 INFO L480 AbstractCegarLoop]: Abstraction has 4276 states and 6081 transitions. [2018-11-18 11:13:27,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 11:13:27,779 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 6081 transitions. [2018-11-18 11:13:27,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-18 11:13:27,780 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:13:27,780 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:13:27,781 INFO L423 AbstractCegarLoop]: === Iteration 78 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:13:27,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:13:27,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1229594943, now seen corresponding path program 1 times [2018-11-18 11:13:27,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:13:27,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:13:27,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:13:27,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:13:27,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:13:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:13:27,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 11:13:27,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:13:27,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 11:13:27,880 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:13:27,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 11:13:27,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 11:13:27,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:13:27,880 INFO L87 Difference]: Start difference. First operand 4276 states and 6081 transitions. Second operand 8 states. [2018-11-18 11:13:28,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:13:28,290 INFO L93 Difference]: Finished difference Result 4334 states and 6147 transitions. [2018-11-18 11:13:28,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 11:13:28,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2018-11-18 11:13:28,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:13:28,299 INFO L225 Difference]: With dead ends: 4334 [2018-11-18 11:13:28,299 INFO L226 Difference]: Without dead ends: 4273 [2018-11-18 11:13:28,301 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-18 11:13:28,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4273 states. [2018-11-18 11:13:28,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4273 to 4273. [2018-11-18 11:13:28,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4273 states. [2018-11-18 11:13:28,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4273 states to 4273 states and 6076 transitions. [2018-11-18 11:13:28,689 INFO L78 Accepts]: Start accepts. Automaton has 4273 states and 6076 transitions. Word has length 101 [2018-11-18 11:13:28,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:13:28,689 INFO L480 AbstractCegarLoop]: Abstraction has 4273 states and 6076 transitions. [2018-11-18 11:13:28,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 11:13:28,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4273 states and 6076 transitions. [2018-11-18 11:13:28,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-18 11:13:28,690 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:13:28,690 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:13:28,690 INFO L423 AbstractCegarLoop]: === Iteration 79 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:13:28,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:13:28,690 INFO L82 PathProgramCache]: Analyzing trace with hash 724166054, now seen corresponding path program 1 times [2018-11-18 11:13:28,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:13:28,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:13:28,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:13:28,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:13:28,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:13:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:13:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:13:28,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:13:28,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:13:28,751 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:13:28,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:13:28,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:13:28,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:13:28,751 INFO L87 Difference]: Start difference. First operand 4273 states and 6076 transitions. Second operand 3 states. [2018-11-18 11:13:29,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:13:29,127 INFO L93 Difference]: Finished difference Result 4275 states and 6077 transitions. [2018-11-18 11:13:29,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:13:29,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2018-11-18 11:13:29,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:13:29,137 INFO L225 Difference]: With dead ends: 4275 [2018-11-18 11:13:29,138 INFO L226 Difference]: Without dead ends: 3973 [2018-11-18 11:13:29,140 INFO L604 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 [2018-11-18 11:13:29,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3973 states. [2018-11-18 11:13:29,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3973 to 3973. [2018-11-18 11:13:29,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3973 states. [2018-11-18 11:13:29,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 5659 transitions. [2018-11-18 11:13:29,533 INFO L78 Accepts]: Start accepts. Automaton has 3973 states and 5659 transitions. Word has length 105 [2018-11-18 11:13:29,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:13:29,533 INFO L480 AbstractCegarLoop]: Abstraction has 3973 states and 5659 transitions. [2018-11-18 11:13:29,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:13:29,533 INFO L276 IsEmpty]: Start isEmpty. Operand 3973 states and 5659 transitions. [2018-11-18 11:13:29,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-18 11:13:29,534 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:13:29,534 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:13:29,534 INFO L423 AbstractCegarLoop]: === Iteration 80 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:13:29,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:13:29,534 INFO L82 PathProgramCache]: Analyzing trace with hash 318665953, now seen corresponding path program 1 times [2018-11-18 11:13:29,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:13:29,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:13:29,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:13:29,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:13:29,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:13:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:13:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 11:13:29,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:13:29,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 11:13:29,664 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:13:29,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 11:13:29,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 11:13:29,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:13:29,664 INFO L87 Difference]: Start difference. First operand 3973 states and 5659 transitions. Second operand 11 states. [2018-11-18 11:13:30,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:13:30,085 INFO L93 Difference]: Finished difference Result 4026 states and 5719 transitions. [2018-11-18 11:13:30,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 11:13:30,086 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2018-11-18 11:13:30,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:13:30,094 INFO L225 Difference]: With dead ends: 4026 [2018-11-18 11:13:30,094 INFO L226 Difference]: Without dead ends: 3944 [2018-11-18 11:13:30,097 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:13:30,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3944 states. [2018-11-18 11:13:30,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3944 to 3944. [2018-11-18 11:13:30,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3944 states. [2018-11-18 11:13:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3944 states and 5626 transitions. [2018-11-18 11:13:30,475 INFO L78 Accepts]: Start accepts. Automaton has 3944 states and 5626 transitions. Word has length 105 [2018-11-18 11:13:30,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:13:30,475 INFO L480 AbstractCegarLoop]: Abstraction has 3944 states and 5626 transitions. [2018-11-18 11:13:30,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 11:13:30,475 INFO L276 IsEmpty]: Start isEmpty. Operand 3944 states and 5626 transitions. [2018-11-18 11:13:30,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 11:13:30,476 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:13:30,476 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:13:30,476 INFO L423 AbstractCegarLoop]: === Iteration 81 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:13:30,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:13:30,477 INFO L82 PathProgramCache]: Analyzing trace with hash -548225758, now seen corresponding path program 1 times [2018-11-18 11:13:30,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:13:30,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:13:30,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:13:30,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:13:30,482 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:13:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:13:30,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:13:30,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:13:30,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:13:30,572 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:13:30,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:13:30,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:13:30,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:13:30,573 INFO L87 Difference]: Start difference. First operand 3944 states and 5626 transitions. Second operand 6 states. [2018-11-18 11:13:30,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:13:30,977 INFO L93 Difference]: Finished difference Result 6326 states and 9084 transitions. [2018-11-18 11:13:30,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:13:30,977 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2018-11-18 11:13:30,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:13:30,985 INFO L225 Difference]: With dead ends: 6326 [2018-11-18 11:13:30,985 INFO L226 Difference]: Without dead ends: 3974 [2018-11-18 11:13:30,990 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:13:30,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3974 states. [2018-11-18 11:13:31,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3974 to 3962. [2018-11-18 11:13:31,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3962 states. [2018-11-18 11:13:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 5648 transitions. [2018-11-18 11:13:31,374 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 5648 transitions. Word has length 110 [2018-11-18 11:13:31,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:13:31,374 INFO L480 AbstractCegarLoop]: Abstraction has 3962 states and 5648 transitions. [2018-11-18 11:13:31,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:13:31,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 5648 transitions. [2018-11-18 11:13:31,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 11:13:31,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:13:31,375 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:13:31,375 INFO L423 AbstractCegarLoop]: === Iteration 82 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:13:31,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:13:31,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1828089436, now seen corresponding path program 1 times [2018-11-18 11:13:31,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:13:31,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:13:31,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:13:31,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:13:31,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:13:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:13:31,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:13:31,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:13:31,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 11:13:31,553 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:13:31,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 11:13:31,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 11:13:31,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:13:31,554 INFO L87 Difference]: Start difference. First operand 3962 states and 5648 transitions. Second operand 9 states. [2018-11-18 11:13:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:13:31,993 INFO L93 Difference]: Finished difference Result 4311 states and 6105 transitions. [2018-11-18 11:13:31,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 11:13:31,993 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2018-11-18 11:13:31,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:13:32,005 INFO L225 Difference]: With dead ends: 4311 [2018-11-18 11:13:32,005 INFO L226 Difference]: Without dead ends: 4022 [2018-11-18 11:13:32,008 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:13:32,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4022 states. [2018-11-18 11:13:32,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4022 to 3972. [2018-11-18 11:13:32,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3972 states. [2018-11-18 11:13:32,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3972 states to 3972 states and 5660 transitions. [2018-11-18 11:13:32,391 INFO L78 Accepts]: Start accepts. Automaton has 3972 states and 5660 transitions. Word has length 110 [2018-11-18 11:13:32,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:13:32,391 INFO L480 AbstractCegarLoop]: Abstraction has 3972 states and 5660 transitions. [2018-11-18 11:13:32,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 11:13:32,391 INFO L276 IsEmpty]: Start isEmpty. Operand 3972 states and 5660 transitions. [2018-11-18 11:13:32,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 11:13:32,392 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:13:32,392 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:13:32,392 INFO L423 AbstractCegarLoop]: === Iteration 83 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:13:32,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:13:32,392 INFO L82 PathProgramCache]: Analyzing trace with hash 523156174, now seen corresponding path program 1 times [2018-11-18 11:13:32,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:13:32,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:13:32,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:13:32,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:13:32,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:13:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:13:32,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:13:32,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:13:32,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 11:13:32,514 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:13:32,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 11:13:32,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 11:13:32,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:13:32,515 INFO L87 Difference]: Start difference. First operand 3972 states and 5660 transitions. Second operand 9 states. [2018-11-18 11:13:33,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:13:33,002 INFO L93 Difference]: Finished difference Result 6105 states and 8792 transitions. [2018-11-18 11:13:33,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 11:13:33,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2018-11-18 11:13:33,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:13:33,010 INFO L225 Difference]: With dead ends: 6105 [2018-11-18 11:13:33,010 INFO L226 Difference]: Without dead ends: 3986 [2018-11-18 11:13:33,015 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:13:33,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2018-11-18 11:13:33,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 3976. [2018-11-18 11:13:33,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3976 states. [2018-11-18 11:13:33,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3976 states to 3976 states and 5664 transitions. [2018-11-18 11:13:33,397 INFO L78 Accepts]: Start accepts. Automaton has 3976 states and 5664 transitions. Word has length 110 [2018-11-18 11:13:33,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:13:33,397 INFO L480 AbstractCegarLoop]: Abstraction has 3976 states and 5664 transitions. [2018-11-18 11:13:33,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 11:13:33,398 INFO L276 IsEmpty]: Start isEmpty. Operand 3976 states and 5664 transitions. [2018-11-18 11:13:33,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-18 11:13:33,398 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:13:33,398 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:13:33,399 INFO L423 AbstractCegarLoop]: === Iteration 84 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:13:33,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:13:33,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1780403211, now seen corresponding path program 1 times [2018-11-18 11:13:33,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:13:33,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:13:33,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:13:33,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:13:33,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:13:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:13:33,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:13:33,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:13:33,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 11:13:33,510 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:13:33,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 11:13:33,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 11:13:33,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:13:33,510 INFO L87 Difference]: Start difference. First operand 3976 states and 5664 transitions. Second operand 8 states. [2018-11-18 11:14:13,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:14:13,355 INFO L93 Difference]: Finished difference Result 8415 states and 11988 transitions. [2018-11-18 11:14:13,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 11:14:13,355 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2018-11-18 11:14:13,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:14:13,369 INFO L225 Difference]: With dead ends: 8415 [2018-11-18 11:14:13,370 INFO L226 Difference]: Without dead ends: 8010 [2018-11-18 11:14:13,372 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-11-18 11:14:13,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8010 states. [2018-11-18 11:14:14,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8010 to 7798. [2018-11-18 11:14:14,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7798 states. [2018-11-18 11:14:14,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7798 states to 7798 states and 11205 transitions. [2018-11-18 11:14:14,166 INFO L78 Accepts]: Start accepts. Automaton has 7798 states and 11205 transitions. Word has length 111 [2018-11-18 11:14:14,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:14:14,166 INFO L480 AbstractCegarLoop]: Abstraction has 7798 states and 11205 transitions. [2018-11-18 11:14:14,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 11:14:14,166 INFO L276 IsEmpty]: Start isEmpty. Operand 7798 states and 11205 transitions. [2018-11-18 11:14:14,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-18 11:14:14,168 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:14:14,168 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:14:14,168 INFO L423 AbstractCegarLoop]: === Iteration 85 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:14:14,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:14:14,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1234700407, now seen corresponding path program 1 times [2018-11-18 11:14:14,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:14:14,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:14:14,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:14:14,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:14:14,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:14:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:14:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:14:14,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:14:14,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 11:14:14,256 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:14:14,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 11:14:14,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 11:14:14,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 11:14:14,257 INFO L87 Difference]: Start difference. First operand 7798 states and 11205 transitions. Second operand 4 states. [2018-11-18 11:14:15,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:14:15,020 INFO L93 Difference]: Finished difference Result 15083 states and 21822 transitions. [2018-11-18 11:14:15,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 11:14:15,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-11-18 11:14:15,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:14:15,037 INFO L225 Difference]: With dead ends: 15083 [2018-11-18 11:14:15,037 INFO L226 Difference]: Without dead ends: 7818 [2018-11-18 11:14:15,049 INFO L604 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 [2018-11-18 11:14:15,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7818 states. [2018-11-18 11:14:15,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7818 to 7818. [2018-11-18 11:14:15,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7818 states. [2018-11-18 11:14:15,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7818 states to 7818 states and 11231 transitions. [2018-11-18 11:14:15,853 INFO L78 Accepts]: Start accepts. Automaton has 7818 states and 11231 transitions. Word has length 111 [2018-11-18 11:14:15,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:14:15,853 INFO L480 AbstractCegarLoop]: Abstraction has 7818 states and 11231 transitions. [2018-11-18 11:14:15,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 11:14:15,853 INFO L276 IsEmpty]: Start isEmpty. Operand 7818 states and 11231 transitions. [2018-11-18 11:14:15,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-18 11:14:15,855 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:14:15,856 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:14:15,856 INFO L423 AbstractCegarLoop]: === Iteration 86 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:14:15,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:14:15,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1245131489, now seen corresponding path program 1 times [2018-11-18 11:14:15,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:14:15,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:14:15,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:14:15,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:14:15,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:14:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:14:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:14:15,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:14:15,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:14:15,961 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2018-11-18 11:14:15,962 INFO L202 CegarAbsIntRunner]: [152], [153], [214], [216], [217], [618], [1087], [1092], [1207], [1210], [1213], [1215], [1231], [1240], [1243], [1250], [1258], [1279], [1280], [1430], [1431], [1716], [1719], [1722], [1729], [1734], [1739], [1742], [2006], [2010], [2013], [2021], [2026], [2031], [2034], [2187], [2190], [2192], [2829], [2830], [2831], [2832], [3662], [3665], [3667], [3670], [3673], [3736], [3911], [3922], [3928], [3934], [3938], [3943], [3947], [3952], [3956], [3958], [3959], [3960], [3962], [3969], [3971], [3972], [3973], [3976], [3980], [4028], [4031], [4037], [4043], [4045], [4047], [4049], [4054], [4056], [4057], [4217], [4220], [4222], [4642], [4643], [4820], [4850], [4851], [4956], [4957], [4958], [4959], [4966], [5006], [5007], [5008], [5009], [5014], [5338], [5340], [5341], [5358], [5384], [5385], [5402], [5403], [5404], [5405], [5410], [5411], [5412], [5413], [5530], [5531], [5532] [2018-11-18 11:14:16,002 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 11:14:16,002 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 11:14:16,166 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:206) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.AssumptionBuilder.constructBoogieAssumeStatement(AssumptionBuilder.java:75) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.getCachedCodeBlock(TermConjunctEvaluator.java:273) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:296) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:536) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:217) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:379) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:380) ... 20 more [2018-11-18 11:14:16,171 INFO L168 Benchmark]: Toolchain (without parser) took 532400.69 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 943.7 MB in the beginning and 768.5 MB in the end (delta: 175.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-11-18 11:14:16,172 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:14:16,172 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3049.42 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 256.4 MB). Free memory was 943.7 MB in the beginning and 1.2 GB in the end (delta: -233.6 MB). Peak memory consumption was 324.6 MB. Max. memory is 11.5 GB. [2018-11-18 11:14:16,172 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.14 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:14:16,173 INFO L168 Benchmark]: Boogie Preprocessor took 294.42 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 69.5 MB). Peak memory consumption was 69.5 MB. Max. memory is 11.5 GB. [2018-11-18 11:14:16,173 INFO L168 Benchmark]: RCFGBuilder took 12185.36 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 30.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.8 MB). Peak memory consumption was 406.2 MB. Max. memory is 11.5 GB. [2018-11-18 11:14:16,173 INFO L168 Benchmark]: TraceAbstraction took 516747.57 ms. Allocated memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: 816.8 MB). Free memory was 1.0 GB in the beginning and 768.5 MB in the end (delta: 265.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-18 11:14:16,176 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 3049.42 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 256.4 MB). Free memory was 943.7 MB in the beginning and 1.2 GB in the end (delta: -233.6 MB). Peak memory consumption was 324.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 120.14 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 294.42 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 69.5 MB). Peak memory consumption was 69.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 12185.36 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 30.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.8 MB). Peak memory consumption was 406.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 516747.57 ms. Allocated memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: 816.8 MB). Free memory was 1.0 GB in the beginning and 768.5 MB in the end (delta: 265.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-5842f4b [2018-11-18 11:14:17,748 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:14:17,749 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:14:17,757 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:14:17,757 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:14:17,758 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:14:17,759 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:14:17,760 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:14:17,762 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:14:17,763 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:14:17,763 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:14:17,764 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:14:17,765 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:14:17,765 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:14:17,766 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:14:17,767 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:14:17,768 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:14:17,770 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:14:17,771 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:14:17,773 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:14:17,774 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:14:17,775 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:14:17,777 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:14:17,777 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:14:17,778 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:14:17,778 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:14:17,779 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:14:17,780 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:14:17,781 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:14:17,782 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:14:17,782 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:14:17,783 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:14:17,783 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:14:17,783 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:14:17,784 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:14:17,784 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:14:17,784 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fc04e408-f2a4-4fba-aac8-059b9783d399/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-18 11:14:17,796 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:14:17,797 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:14:17,797 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 11:14:17,798 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 11:14:17,798 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 11:14:17,798 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 11:14:17,798 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 11:14:17,798 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 11:14:17,798 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 11:14:17,798 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 11:14:17,799 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:14:17,799 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:14:17,799 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:14:17,800 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:14:17,800 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 11:14:17,800 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 11:14:17,801 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 11:14:17,801 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 11:14:17,801 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 11:14:17,801 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:14:17,801 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:14:17,801 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:14:17,801 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 11:14:17,802 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:14:17,802 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:14:17,802 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 11:14:17,802 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 11:14:17,802 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 11:14:17,802 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:14:17,802 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 11:14:17,802 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 11:14:17,802 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-18 11:14:17,803 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 11:14:17,803 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 11:14:17,803 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 11:14:17,803 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_fc04e408-f2a4-4fba-aac8-059b9783d399/bin-2019/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 -> c382c054908dd436240a631a5e6d7113fd867a7b [2018-11-18 11:14:17,835 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:14:17,845 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:14:17,847 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:14:17,848 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:14:17,848 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:14:17,849 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fc04e408-f2a4-4fba-aac8-059b9783d399/bin-2019/utaipan/../../sv-benchmarks/c/ntdrivers/parport_true-unreach-call.i.cil.c [2018-11-18 11:14:17,889 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fc04e408-f2a4-4fba-aac8-059b9783d399/bin-2019/utaipan/data/5d96d7569/bac30600be3b4d40a2a49e1b95c5a573/FLAGae3280c16 [2018-11-18 11:14:18,432 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:14:18,433 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fc04e408-f2a4-4fba-aac8-059b9783d399/sv-benchmarks/c/ntdrivers/parport_true-unreach-call.i.cil.c [2018-11-18 11:14:18,461 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fc04e408-f2a4-4fba-aac8-059b9783d399/bin-2019/utaipan/data/5d96d7569/bac30600be3b4d40a2a49e1b95c5a573/FLAGae3280c16 [2018-11-18 11:14:18,662 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fc04e408-f2a4-4fba-aac8-059b9783d399/bin-2019/utaipan/data/5d96d7569/bac30600be3b4d40a2a49e1b95c5a573 [2018-11-18 11:14:18,664 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:14:18,665 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:14:18,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:14:18,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:14:18,669 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:14:18,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:14:18" (1/1) ... [2018-11-18 11:14:18,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d16e451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:14:18, skipping insertion in model container [2018-11-18 11:14:18,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:14:18" (1/1) ... [2018-11-18 11:14:18,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:14:18,787 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:14:20,973 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:14:20,998 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:14:21,485 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:14:21,764 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:14:21,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:14:21 WrapperNode [2018-11-18 11:14:21,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:14:21,765 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:14:21,765 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:14:21,766 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:14:21,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:14:21" (1/1) ... [2018-11-18 11:14:21,799 ERROR L1129 TypeChecker]: C: malloc(EntrySize) [2133]: Wrong parameter type at index 0: CallStatement[false,[VariableLHS[#t~malloc29,]],#Ultimate.alloc,[IdentifierExpression[~EntrySize,]]] [2018-11-18 11:14:21,831 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:14:21" (1/1) ... [2018-11-18 11:14:21,832 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:14:21,832 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2018-11-18 11:14:21,833 INFO L168 Benchmark]: Toolchain (without parser) took 3168.22 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 285.7 MB). Free memory was 937.8 MB in the beginning and 1.2 GB in the end (delta: -217.4 MB). Peak memory consumption was 68.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:14:21,834 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:14:21,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3099.14 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 285.7 MB). Free memory was 937.8 MB in the beginning and 1.2 GB in the end (delta: -224.5 MB). Peak memory consumption was 297.5 MB. Max. memory is 11.5 GB. [2018-11-18 11:14:21,836 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.48 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-11-18 11:14:21,838 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 3099.14 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 285.7 MB). Free memory was 937.8 MB in the beginning and 1.2 GB in the end (delta: -224.5 MB). Peak memory consumption was 297.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.48 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - TypeErrorResult [Line: 2133]: Type Error Wrong parameter type at index 0: CallStatement[false,[VariableLHS[#t~malloc29,]],#Ultimate.alloc,[IdentifierExpression[~EntrySize,]]] RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...